Author of the publication

Data-abstraction refinement: a game semantic approach.

, , , and . Int. J. Softw. Tools Technol. Transf., 12 (5): 373-389 (2010)

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

The ideal view on Rackoff's coverability technique., and . Inf. Comput., (2021)Safety alternating automata on data words.. ACM Trans. Comput. Log., 12 (2): 10:1-10:24 (2011)Model Checking Freeze LTL over One-Counter Automata., , and . FoSSaCS, volume 4962 of Lecture Notes in Computer Science, page 490-504. Springer, (2008)Contextual Approximation and Higher-Order Procedures., and . FoSSaCS, volume 9634 of Lecture Notes in Computer Science, page 162-179. Springer, (2016)When is Containment Decidable for Probabilistic Automata?., , , , , and . ICALP, volume 107 of LIPIcs, page 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Verification column.. ACM SIGLOG News, 7 (3): 28 (2020)Verification column.. ACM SIGLOG News, 6 (4): 3 (2019)Verification column.. ACM SIGLOG News, 8 (4): 3 (2021)Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems., , , and . ACM Trans. Comput. Log., 20 (3): 14:1-14:31 (2019)When are emptiness and containment decidable for probabilistic automata?, , , , , and . J. Comput. Syst. Sci., (2021)