Author of the publication

The Decidability of Model Checking Mobile Ambients.

, and . CSL, volume 2142 of Lecture Notes in Computer Science, page 339-354. Springer, (2001)

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

Solving Classes of Set Constraints with Tree Automata., , and . CP, volume 1330 of Lecture Notes in Computer Science, page 62-76. Springer, (1997)Paths vs. Trees in Set-Based Program Analysis., , and . POPL, page 330-337. ACM, (2000)Weighted Automata and Expressions over Pre-Rational Monoids., , , , , and . CSL, volume 216 of LIPIcs, page 6:1-6:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Trimming Visibly Pushdown Automata., , and . CIAA, volume 7982 of Lecture Notes in Computer Science, page 84-96. Springer, (2013)Determinisation of Finitely-Ambiguous Copyless Cost Register Automata., , and . MFCS, volume 138 of LIPIcs, page 75:1-75:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Model-checking pour les ambients : des algèbres de processus aux données semi-structurées.. (2005)Co-definite Set Constraints with Membership Expressions., , and . IJCSLP, page 25-39. MIT Press, (1998)Visibly Pushdown Transducers with Well-Nested Outputs., and . Int. J. Found. Comput. Sci., 27 (2): 235-258 (2016)Generalized Definite Set Constraints., , and . Constraints An Int. J., 5 (1/2): 161-202 (2000)The Decidability of Model Checking Mobile Ambients., and . CSL, volume 2142 of Lecture Notes in Computer Science, page 339-354. Springer, (2001)