Resource Bound Analysis
Computer programs are consuming physical resources such as time, memory, power and bandwidth. To guarantee that a program only uses a limited amount of these resources, programmers need automatic tools which predict the resource consumption of a program. We investigate theoretical frameworks that allow to model and analyze the complexity of programs and build practical program analysis tools that allow to infer bounds on the resource consumption of the program under analysis.
Feedback Generation for Introductory Programming Problems
Providing feedback on programming assignments is an integral part of a class on introductory programming and requires substantial effort by the teaching personnel. This problem has become even more significant today with the increasing popularity of programming education. We investigate automated methods for generating feedback on introductory programming assignments.
Liveness Properties of Parameterized Systems
Parameterized systems consist of an arbitrary number of replications of the same system component. The challenge is to verify the correctness of such systems for all possible system sizes. Results on the decidability of such systems are scarce and have mostly been obtained for safety properties. We investigate the decidability of liveness properties and study how to obtain quantitative measures for the progress of the system.
||| Prompt Alternating-Time Epistemic Logics|
Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016., pages 258-267, 2016.
||| Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments|
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, May 9-13, 2016, pages 1190-1199, 2016.
||| Empirical Software Metrics for Benchmarking of Verification Tools|
Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I, pages 561-579, July 2015.
||| Extending ALCQIO with Trees|
30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 511-522, 2015.
|||Verification of Asynchronous Mobile-Robots in Partially-Known Environments|
PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Bertinoro, Italy, October 26-30, 2015, Proceedings, volume 9387 of Lecture Notes in Computer Science, pages 185-200, 2015, Springer.
|||On the Expressive Power of Communication Primitives in Parameterised Systems|
Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings, volume 9450 of Lecture Notes in Computer Science, pages 313-328, 2015, Springer.
|||Liveness of Parameterized Timed Networks|
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, volume 9135 of Lecture Notes in Computer Science, pages 375-387, 2015, Springer.
|||Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems|
Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, volume 9139 of Lecture Notes in Computer Science, pages 426-442, 2015, Springer.
|||Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs|
Formal Methods in Computer-Aided Design (FMCAD) (Roope Kaivola, Thomas Wahl, eds.), pages 144-151, 2015, IEEE.
||| Loop Patterns in C Programs|
ECEASST, volume 72, 2015.
|||Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability|
Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014., pages 591-594, 2014.
|||Shape and Content: Incorporating Domain Knowledge into Shape Analysis|
Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014., pages 124-127, 2014.
||| A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis|
Chapter in Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings, pages 745-761, 2014.
||| Feedback Generation for Performance Problems in Introductory Programming Assignments|
Proceedings of the 22Nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, pages 41-51, 2014, ACM.
||| Size-Change Abstraction and Max-Plus Automata|
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, pages 208-219, 2014.
||| Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures|
Integrated Formal Methods - 11th International Conference, IFM 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings, pages 3-17, 2014.
|||Ramsey vs. Lexicographic Termination Proving|
TACAS, pages 47-61, 2013.
||| On the Concept of Variable Roles and its Use in Software Analysis|
FMCAD, pages 226-229, 2013.
Technische Universität Wien
Institut für Informationssysteme 184/4
|Room:||HG 03 09 (how to get there)|
|Phone:||+43 (1) 58801 – 184 49|