Author of the publication

Flat counter automata almost everywhere!.

, and . Software Verification: Infinite-State Model Checking and Static Program Analysis, volume 06081 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems., , and . LPAR, volume 2850 of Lecture Notes in Computer Science, page 361-375. Springer, (2003)Decidability of Reachability Problems for Classes of Two Counters Automata., and . STACS, volume 1770 of Lecture Notes in Computer Science, page 346-357. Springer, (2000)Hyper-Ackermannian bounds for pushdown vector addition systems., , and . CSL-LICS, page 63:1-63:10. ACM, (2014)Accelerated Data-Flow Analysis., and . SAS, volume 4634 of Lecture Notes in Computer Science, page 184-199. Springer, (2007)The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems., , and . ATVA, volume 8837 of Lecture Notes in Computer Science, page 248-263. Springer, (2014)Well-Abstracted Transition Systems., , and . CONCUR, volume 1877 of Lecture Notes in Computer Science, page 566-580. Springer, (2000)On Flatness for 2-Dimensional Vector Addition Systems with States., and . CONCUR, volume 3170 of Lecture Notes in Computer Science, page 402-416. Springer, (2004)Lazy abstraction., , , and . POPL, page 58-70. ACM, (2002)ACM SIGPLAN Notices 37(1), January 2002.Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free., and . CONCUR, volume 171 of LIPIcs, page 37:1-37:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems., , and . SPIN, volume 5578 of Lecture Notes in Computer Science, page 107-124. Springer, (2009)