Joel Ouaknine

Dr Joel Ouaknine

Reader in Computer Science
Tutorial Fellow, St John's College

Room 409, Wolfson Building, Parks Road, Oxford OX1 3QD

Reachability in Succinct and Parametric One-Counter Automata

Christoph Haase et al.

In M. Bravetti, G. Zavattaro, editors, Proceedings of the 20th International Conference on Concurrency Theory (CONCUR09) Vol. 5710 of Lecture Notes in Computer Science, pages 369—383. Springer, September 2009.

Details | BibTeX | Download (pdf)

Verification

Concurrency | Hardware Verification | Quantitative Analysis and Verification

CSP Model Checking | Model-Checking for Timed Systems | Automated Verification of Probabilistic Programs | Quantitative Verification: From Model Checking to Model Measuring | Verification of Shared-Memory Concurrent Software

Ed Blakey  | Christoph Haase  | Maneesh Khattri  | Hristina Palikareva