Author of the publication

Polynomial-Time Equivalence Testing for Deterministic Fresh-Register Automata.

, , and . MFCS, volume 117 of LIPIcs, page 72:1-72:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Nominal Game Semantics., and . Foundations and Trends in Programming Languages, 2 (4): 191-269 (2016)Higher-Order Bounded Model Checking., and . CoRR, (2018)Towards Nominal Abramsky., and . Computation, Logic, Games, and Quantum Foundations, volume 7860 of Lecture Notes in Computer Science, page 246-263. Springer, (2013)Program Equivalence with Names.. Modelling, Controlling and Reasoning About State, volume 10351 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)There and Back Again: From Bounded Checking to Verification of Program Equivalence via Symbolic Up-to Techniques., , and . CoRR, (2021)Semantics and Verification of Object-Oriented Languages (NII Shonan Meeting 2015-13)., , and . NII Shonan Meet. Rep., (2015)Fresh-register automata.. POPL, page 295-306. ACM, (2011)Block Structure vs. Scope Extrusion: Between Innocence and Omniscience., and . FoSSaCS, volume 6014 of Lecture Notes in Computer Science, page 33-47. Springer, (2010)Introduction to Categories and Categorical Logic, and . CoRR, (2011)History-Register Automata, and . Logical Methods in Computer Science, (2016)