From post

Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties.

, и . CAV, том 575 из Lecture Notes in Computer Science, стр. 332-342. Springer, (1991)

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.

 

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

Simple on-the-fly automatic verification of linear temporal logic., , , и . PSTV, том 38 из IFIP Conference Proceedings, стр. 3-18. Chapman & Hall, (1995)Automata-Theoretic Techniques for Modal Logics of Programs., и . J. Comput. Syst. Sci., 32 (2): 183-221 (1986)Reasoning about Cryptographic Protocols., и . Distributed Computing And Cryptography, том 2 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 245-. DIMACS/AMS, (1989)On the Representation of Infinite Temporal Data and Queries., , и . PODS, стр. 280-290. ACM Press, (1991)Handling Liveness Properties in (omega-)Regular Model Checking., , и . INFINITY, том 138 из Electronic Notes in Theoretical Computer Science, стр. 101-115. Elsevier, (2004)A direct symbolic approach to model checking pushdown systems., , и . INFINITY, том 9 из Electronic Notes in Theoretical Computer Science, стр. 27-37. Elsevier, (1997)Reliable Hashing without Collosion Detection., и . CAV, том 697 из Lecture Notes in Computer Science, стр. 59-70. Springer, (1993)An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract), и . SAS, том 983 из Lecture Notes in Computer Science, стр. 21-32. Springer, (1995)On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)., , и . ICALP, том 1443 из Lecture Notes in Computer Science, стр. 152-163. Springer, (1998)An effective decision procedure for linear arithmetic over the integers and reals., , и . ACM Trans. Comput. Log., 6 (3): 614-633 (2005)