From post

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.

 

Другие публикации лиц с тем же именем

Automated Compositional Reasoning of Intuitionistically Closed Regular Properties., и . CIAA, том 5148 из Lecture Notes in Computer Science, стр. 36-45. Springer, (2008)Deriving a Scalable Algorithm for Mutual Exclusion.. DISC, том 1499 из Lecture Notes in Computer Science, стр. 393-407. Springer, (1998)From Linear Temporal Logics to Büchi Automata: The Early and Simple Principle., и . Model Checking, Synthesis, and Learning, том 13030 из Lecture Notes in Computer Science, стр. 8-40. Springer, (2021)GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae., , , , и . TACAS, том 4424 из Lecture Notes in Computer Science, стр. 466-471. Springer, (2007)Compositional Verification in Linear-Time Temporal Logic.. FoSSaCS, том 1784 из Lecture Notes in Computer Science, стр. 344-358. Springer, (2000)Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages., , , , и . TACAS, том 4963 из Lecture Notes in Computer Science, стр. 2-17. Springer, (2008)Operational Implication of Conditional Unity Properties., и . Specification of Parallel Algorithms, том 18 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 91-100. DIMACS/AMS, (1994)THOR: A Tool for Reasoning about Shape and Arithmetic., , , и . CAV, том 5123 из Lecture Notes in Computer Science, стр. 428-432. Springer, (2008)Automatic numeric abstractions for heap-manipulating programs., , , и . POPL, стр. 211-222. ACM, (2010)Büchi Store: An Open Repository of Büchi Automata., , , и . TACAS, том 6605 из Lecture Notes in Computer Science, стр. 262-266. Springer, (2011)