From post

Automated Compositional Reasoning of Intuitionistically Closed Regular Properties.

, и . CIAA, том 5148 из Lecture Notes in Computer Science, стр. 36-45. Springer, (2008)

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.

 

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

Deriving a Scalable Algorithm for Mutual Exclusion.. DISC, том 1499 из Lecture Notes in Computer Science, стр. 393-407. Springer, (1998)Automated Compositional Reasoning of Intuitionistically Closed Regular Properties., и . CIAA, том 5148 из Lecture Notes in Computer Science, стр. 36-45. Springer, (2008)Deducing Fairness Properties in UNITY Logic - A New Completeness Result., и . ACM Trans. Program. Lang. Syst., 17 (1): 16-27 (1995)Assumption/Guarantee Specifications in Linear-Time Temporal Logic., и . Theor. Comput. Sci., 167 (1&2): 47-72 (1996)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)Some Impossibility Results in Interprocess Synchronization., и . Distributed Comput., 6 (4): 221-231 (1993)Compositional Verification in Linear-Time Temporal Logic.. FoSSaCS, том 1784 из Lecture Notes in Computer Science, стр. 344-358. Springer, (2000)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)Automatic numeric abstractions for heap-manipulating programs., , , и . POPL, стр. 211-222. ACM, (2010)