Lechner M. 2022. Learning verifiable representations. Institute of Science and Technology Austria.

Kragl B. 2020. Verifying concurrent programs: Refinement, synchronization, sequentialization. Institute of Science and Technology Austria.

Giacobbe M. 2019. Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria.

Daca P. 2017. Statistical and logical methods for property checking. Institute of Science and Technology Austria.

Tarrach T. 2016. Automatic synthesis of synchronisation primitives for concurrent programs. Institute of Science and Technology Austria.

Zufferey D. 2013. Analysis of dynamic message passing programs. Institute of Science and Technology Austria.

Prabhu V. 2008. Games for the verification of timed systems. University of California, Berkeley.

Matic S. 2008. Compositionality in deterministic real-time embedded systems. University of California, Berkeley.

Ghosal A. 2008. A hierarchical coordination language for reliable real-time tasks. University of California, Berkeley.

Chakrabarti A. 2007. A framework for compositional design and analysis of systems. University of California, Berkeley.

Jhala R. 2004. Program verification by lazy abstraction. University of California, Berkeley.

Majumdar R. 2003. Symbolic algorithms for verification and control. University of California, Berkeley.

Horowitz B. 2003. Giotto: A time-triggered language for embedded programming. University of California, Berkeley.

Mang F. 2002. Games in open systems verification and synthesis. University of California, Berkeley.

Qadeer S. 1999. Algorithms and Methodology for Scalable Model Checking. University of California, Berkeley.

Kopke P. 1996. The Theory of Rectangular Hybrid Automata. Cornell University.

Ho P. 1995. Automatic analysis of hybrid systems. Cornell University.