Publications (journals)

• Pierre Wolper. Temporal logic can be more expressive. Information and Control, 56(1--2):72--99, 1983.

• Zohar Manna and Pierre Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68--93, January 1984.

• Pierre Wolper. The tableau method for temporal logic: An overview. Logique et Analyse, (110--111):119--136, 1985.

• Moshe Y. Vardi and Pierre Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):183--221, April 1986.

• A. Prasad Sistla, Moshe Y. Vardi, and Pierre Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49:217--237, 1987.

• Sudhir Aggarwal, Constantin Courcoubetis, and Pierre Wolper. Adding liveness properties to coupled finite-state machines. ACM Transactions on Programming Languages and Systems, 12(2):303--339, 1990.

• Constantin Courcoubetis, Moshe Y. Vardi, Pierre Wolper, and Mihalis Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1:275--288, 1992.

• Patrice Godefroid and Pierre Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. Formal Methods in System Design, 2(2):149--164, April 1993.

• Patrice Godefroid and Pierre Wolper. A partial approach to model checking. Information and Computation, 110(2):305--326, May 1994.

• Moshe Y. Vardi and Pierre Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1--37, November 1994.

• Froduald Kabanza, Jean-Marc Stévenne, and Pierre Wolper. Handling infinite temporal data. Journal of Computer and System Sciences, 51(1):3--17, August 1995.

• Pierre Wolper. Where is the algorithmic support? ACM Computing Surveys, 28(4es):58, December 1996. (Electronic Supplement to Computing Surveys).

• Pierre Wolper. The meaning of ``formal''. ACM Computing Surveys, 28(4es):127, December 1996. (Electronic Supplement to Computing Surveys).

• Pierre Wolper. The meaning of formal: from weak to strong formal methods. Springer International Journal on Software Tools for Technology Transfer, 1(1-2):6--8, 1997.

• Doron Peled, Thomas Wilke, and Pierre Wolper. An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages. Theoretical Computer Science, 195(2):183--203, 1998.

• Marianne Baudinet, Jan Chomicki, and Pierre Wolper. Constraint-generating dependencies. Journal of Computer and System Sciences, 59(1):94--115, 1999.

• Orna Kupferman, Moshe Y. Vardi, and Pierre Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312--360, march 2000.

• Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, and Pierre Wolper. An efficient automata approach to some problems on context-free grammars. Information Processing Letters, 74(5-6):221--227, June 2000.

• Orna Kupferman, Moshe~Y. Vardi, and Pierre Wolper. Module checking. Information and Computation, 164:322--344, 2001.

• Bernard Boigelot, Sébastien Jodogne, and Pierre Wolper. On the use of weak automata for deciding linear arithmetic with integer and real variables. ACM transactions on Computational Logic, 6(3):614--633, July 2005.

Links

• Pierre Wolper
• Pierre Wolper - Bibliography