( en | de | ru )

 

Disambiguation of "Wolper, Pierre"

Author of the publication

copydeleteadd this publication to your clipboard
Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract)

, and . STOC, page 446-456. ACM, (1984)

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.

Carolin Wölper

Günter Wolper

Christoph Wölper

Charlotte Nothdurft-Wölper

Pierre Mattern

 

Other publications of authors with the same name

Where is the Algorithmic Support?. ACM Comput. Surv., 28 (4es): 58 (1996)Simple on-the-fly automatic verification of linear temporal logic., , , and . PSTV, volume 38 of IFIP Conference Proceedings, page 3-18. Chapman & Hall, (1995)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)Adding Liveness Properties to Coupled Finite-State Machines., , and . ACM Trans. Program. Lang. Syst., 12 (2): 303-339 (1990)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)Handling Liveness Properties in (omega-)Regular Model Checking., , and . INFINITY, volume 138 of Electronic Notes in Theoretical Computer Science, page 101-115. Elsevier, (2004)On the Representation of Infinite Temporal Data and Queries., , and . PODS, page 280-290. ACM Press, (1991)Reliable Hashing without Collosion Detection., and . CAV, volume 697 of Lecture Notes in Computer Science, page 59-70. Springer, (1993)An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract), and . SAS, volume 983 of Lecture Notes in Computer Science, page 21-32. Springer, (1995)