Author of the publication

Counterexample Validation and Interpolation-Based Refinement for Forest Automata.

, , , , and . VMCAI, volume 10145 of Lecture Notes in Computer Science, page 288-309. Springer, (2017)

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

Automata-Based Termination Proofs., and . CIAA, volume 5642 of Lecture Notes in Computer Science, page 165-177. Springer, (2009)Counterexample Validation and Interpolation-Based Refinement for Forest Automata., , , , and . VMCAI, volume 10145 of Lecture Notes in Computer Science, page 288-309. Springer, (2017)SL-COMP: Competition of Solvers for Separation Logic., , , , , , , , , and 14 other author(s). TACAS (3), volume 11429 of Lecture Notes in Computer Science, page 116-132. Springer, (2019)Automata-Based Termination Proofs., and . Comput. Informatics, 32 (4): 739-775 (2013)Abstraction refinement and antichains for trace inclusion of infinite state systems., , , and . Formal Methods Syst. Des., 55 (3): 137-170 (2020)Abstraction Refinement for Trace Inclusion of Data Automata., , and . CoRR, (2014)Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems., , and . TACAS, volume 9636 of Lecture Notes in Computer Science, page 71-89. Springer, (2016)Deciding Entailments in Inductive Separation Logic with Tree Automata., , and . ATVA, volume 8837 of Lecture Notes in Computer Science, page 201-218. Springer, (2014)From Shapes to Amortized Complexity., , , , , and . VMCAI, volume 10747 of Lecture Notes in Computer Science, page 205-225. Springer, (2018)Abstract Regular Tree Model Checking., , , and . INFINITY, volume 149 of Electronic Notes in Theoretical Computer Science, page 37-48. Elsevier, (2005)