Author of the publication

Analyzing Fair Parametric Extended Automata.

, , , and . SAS, volume 2126 of Lecture Notes in Computer Science, page 335-355. 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

Planning Robust Temporal Plans: A Comparison Between CBTP and TGA Approaches., , , , , and . ICAPS, page 2-9. AAAI, (2007)A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes., , and . TACAS, volume 4424 of Lecture Notes in Computer Science, page 690-705. Springer, (2007)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)Exploiting Pointer Analysis in Memory Models for Deductive Verification., , , and . VMCAI, volume 11388 of Lecture Notes in Computer Science, page 160-182. Springer, (2019)Hierarchical Shape Abstraction for Analysis of Free List Memory Allocators., and . LOPSTR, volume 10184 of Lecture Notes in Computer Science, page 151-167. Springer, (2016)What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment?, , , and . IJCAR (2), volume 14740 of Lecture Notes in Computer Science, page 157-175. Springer, (2024)Rewriting Systems over Nested Data Words., , , and . MEMICS, volume 13 of OASIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2009)Exploiting Pointer Analysis in Memory Models for Deductive Verification., , , and . CoRR, (2018)Synthesis and Verification of Constraints in the PGM Protocol., and . FME, volume 2805 of Lecture Notes in Computer Science, page 264-281. Springer, (2003)A refinement hierarchy for free list memory allocators., and . ISMM, page 104-114. ACM, (2017)