Andreas Haas

I received my PhD at the Department of Computer Sciences at the University of Salzburg. My advisor was Christoph M. Kirsch, my co-advisor was Ana Sokolova. E-mail: andreas.haas@cs.uni-salzburg.at

Projects:

• Scal, a collection of fast and scalable concurrent data structures.
• Short-term Memory, an alternative memory model for heap management.

Publications:

• Fast Concurrent Data Structures Through Timestamping pdf, bib
  PhD Thesis, Department of Computer Sciences, University of Salzburg, July 2015.

• A Scalable, Correct Time-Stamped Stack pdf, bib
  Together with Mike Dodds, Christoph M. Kirsch
  In Proc. Symposium on Principles of Programming Languages (POPL), 2015.

• Fast Concurrent Data-Structures Through Explicit Timestamping pdf, bib
  Together with Mike Dodds, Christoph M. Kirsch,
  Technical report TR-2014-02, Department of Computer Sciences, University of Salzburg, 2014.

• Distributed Queues in Shared Memory - Multicore Performance and Scalability through Quantitative Relaxation pdf, bib
  Together with Thomas A. Henzinger, Christoph M. Kirsch, Michael Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova
  In Proc. International Conference on Computing Frontiers (CF), 2013.

• How FIFO is Your Concurrent FIFO Queue? pdf, bib
  Together with Christoph M. Kirsch, Michael Lippautz, Hannes Payer
  In Proc. OOPSLA Workshop on Relaxing Synchronization for Multicore and Manycore Scalability (RACES), 2012.

• Short-term Memory for Self-collecting Mutators pdf, bib
  Together with Martin Aigner, Christoph M. Kirsch, Michael Lippautz, Ana Sokolova, Stephanie Stroka, Andreas Unterweger
  In Proc. International Symposium on Memory Management (ISMM), 2011.

• Short-term Memory for Self-collecting Mutators - Revised Version pdf, bib
  Together with Martin Aigner, Christoph M. Kirsch, Ana Sokolova
  Technical report TR-2010-06, Department of Computer Sciences, University of Salzburg, 2010.

• Information-Acquisition-as-a-Service for Cyber-Physical Cloud Computing pdf, bib
  Together with Silviu S. Craciunas, Christoph M. Kirsch, Hannes Payer, Harald Röck, Andreas Rottmann, Ana Sokolova, Rainer Trummer, Joshua Love, Raja Sengupta
  In Proc. Workshop on Hot Topics in Cloud Computing (HotCloud), 2010.

• Short-term Memory for Self-collecting Mutators pdf, bib
  Together with Martin Aigner, Christoph M. Kirsch, Hannes Payer, Andreas Schönegger, Ana Sokolova
  Technical report TR-2010-03, Department of Computer Sciences, University of Salzburg, 2010.

• Expiration Classes for Implicit Memory Management pdf, slides, bib
  Master Thesis, Department of Computer Sciences, University of Salzburg, September 2009.

Posters:

• Fast Concurrent Data-Structures Through Explicit Timestamping pdf
  Together with Mike Dodds, Christoph M. Kirsch
  Presented at Google's 1st European PhD Student Summit on Compiler and Programming Technology, November 2013.

Teaching:

• PS Formale Systeme WS2014
• PS Formale Systeme WS2012
• PS Formale Systeme WS2011

Talks:

• Fast Concurrent Data Structures Through Timestamping
  • PhD Defense, Salzburg, Austria, 23rd of November 2015 (30 min. talk) slides (svg + JavaScript)
• A Scalable, Correct, Time-Stamped Stack
  • Google Tech Talk, Munich, Germany, 11th of August 2015 (45 min. talk) slides (svg + JavaScript)
  • POPL 2015, Mumbai, India, 15th of January 2015 (25 min. talk) slides (svg + JavaScript)
  • RiSE and PUMA Workshop, Mondsee, Austria, 3rd of October 2014 (20 min. talk) slides (svg + JavaScript)
  • FRIDA 2014, Vienna, Austria, 24th of July 2014 (25 min. talk) slides (svg + JavaScript)
• Fast Concurrent Data-Structures Through Explicit Timestamping
  • YCW 2014, York, UK, 29th of April 2014 (25 min. talk) slides (svg + JavaScript)
• Fairness vs. Linearizability in a Concurrent FIFO Queue
  • University of York, UK, 4th of March 2014 (45 min. talk) slides (svg + JavaScript)
  • DMTM 2014, Vienna, Austria, 22nd of January 2014 (25 min. talk) slides (svg + JavaScript), abstract (pdf)
• How FIFO is Your Concurrent FIFO Queue?
  • University of York, UK, 12th of September 2013 (45 min. talk) slides (svg + JavaScript)
  • RACES 2012, Tucson, Arizona, 20th of October 2012 (20 min. talk) slides (svg + JavaScript), video (YouTube)
  • RISE and PUMA Workshop, Goldegg, Austria, 24th of September 2012 (30 min. talk) slides (svg + JavaScript)
• Short-term Memory for Self-collecting Mutators
  • University of Kent, UK, 29th of September 2011 (45 min. talk) slides (svg + JavaScript)
  • Google Tech Talk, London, UK, 26th of June 2011 (45 min. talk) slides (svg + JavaScript)
  • ISMM 2011, San Jose, California, 5th of June 2011 (25 min. talk) slides (svg + JavaScript)
  • PUMA Workshop, Szentendre, Hungary, 12th of October 2010 (45 min. talk) slides (pdf)
• Towards Automating Heap Management through Short-term Memory
  • WRISE 2011, EuroSys Salzburg, Austria, 10th of April 2011 (30 min. talk) slides (svg + JavaScript)
• Short-term Memory for Self-collecting Mutators: Towards Time- and Space-predictable Virtualization
  • RISE Workshop, Graz, Austria, 23rd of February 2010 (30 min. talk, together with Ana Sokolova) slides (pdf) slides (keynote) (Slides mainly by Christoph M. Kirsch)