Author of the publication

Memory Efficient Algorithms for the Verification of Temporal Properties.

, , , and . CAV, volume 531 of Lecture Notes in Computer Science, page 233-242. Springer, (1990)

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

Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties., and . Formal Methods Syst. Des., 2 (2): 149-164 (1993)Automata-Theoretic Techniques for Modal Logics of Programs., and . J. Comput. Syst. Sci., 32 (2): 183-221 (1986)Simple on-the-fly automatic verification of linear temporal logic., , , and . PSTV, volume 38 of IFIP Conference Proceedings, page 3-18. Chapman & Hall, (1995)Where is the Algorithmic Support?. ACM Comput. Surv., 28 (4es): 58 (1996)Adding Liveness Properties to Coupled Finite-State Machines., , and . ACM Trans. Program. Lang. Syst., 12 (2): 303-339 (1990)On the Representation of Infinite Temporal Data and Queries., , and . PODS, page 280-290. ACM Press, (1991)Handling Liveness Properties in (omega-)Regular Model Checking., , and . INFINITY, volume 138 of Electronic Notes in Theoretical Computer Science, page 101-115. Elsevier, (2004)Reasoning about Cryptographic Protocols., and . Distributed Computing And Cryptography, volume 2 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 245-. DIMACS/AMS, (1989)A direct symbolic approach to model checking pushdown systems., , and . INFINITY, volume 9 of Electronic Notes in Theoretical Computer Science, page 27-37. Elsevier, (1997)Reliable Hashing without Collosion Detection., and . CAV, volume 697 of Lecture Notes in Computer Science, page 59-70. Springer, (1993)