Publications (conferences)

• Pierre Wolper. Temporal logic can be more expressive. In Proceedings of the 22nd IEEE Symposium on Foundations of Computer Science, pages 340--348, Nashville, October 1981.

• Zohar Manna and Pierre Wolper. Synthesis of communicating processes from temporal logic specifications. In Proceedings of the Workshop on Logics of Programs, volume 131, of Lecture Notes in Computer Science, pages 253--281. Springer-Verlag, 1982.

• Pierre Wolper. Specification and synthesis of communicating processes using an extended temporal logic. In Proc. 9th Symposium on Principles of Programming Languages, pages 20--33, Albuquerque, January 1982.

• Pierre Wolper, Moshe Y. Vardi, and A. Prasad Sistla. Reasoning about infinite computation paths. In Proc. 24th IEEE Symposium on Foundations of Computer Science, pages 185--194, Tucson, 1983.

• Moshe Y. Vardi and Pierre Wolper. Yet another process logic. In Logics of Programs, volume 164 of Lecture Notes in Computer Science, pages 501--512. Springer-Verlag, 1984.

• Moshe Y. Vardi and Pierre Wolper. Automata-theoretic techniques for modal logics of programs. In Proc. 16th ACM Symposium on Theory of Computing, pages 446--456, May 1984.

• Shlomit Pinter and Pierre Wolper. A temporal logic for reasoning about partially ordered computations. In Proc. 3rd ACM Symposium on Principles of Distributed Computing, pages 28--37, Vancouver, August 1984.

• A. Prasad Sistla, Moshe Y. Vardi, and Pierre Wolper. The complementation problem for Büchi automata with applications to temporal logic. In Proc. 10th Int. Colloquium on Automata, Languages and Programming, volume 194 of Lecture Notes in Computer Science, pages 465--474, Nafplion, July 1985. Springer-Verlag.

• Krishan Sabnani, Pierre Wolper, and Aleta Lapone. An algorithmic technique for protocol verification. In Proc. Globecom '85, New Orleans, December 1985.

• Pierre Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proc. 13th ACM Symp. on Principles of Programming Langauges, pages 184--192, St. Petersburgh, January 1986.

• Constantin Courcoubetis, Moshe Y. Vardi, and Pierre Wolper. Reasoning about fair concurrent programs. In Proc. 18th ACM Symp. on Theory of Computing, pages 283--294, Berkeley, May 1986.

• Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322--331, Cambridge, June 1986.

• Pierre Wolper. On the relation of programs and computations to models of temporal logic. In B. Banieqbal, H. Barringer, and A. Pnueli, editors, Proc. Temporal Logic in Specification, volume 398 of Lecture Notes in Computer Science, pages 75--123. Springer-Verlag, 1989.

• Pierre Wolper and Vinciane Lovinfosse. Verifying properties of large sets of processes with network invariants. In Automatic Verification Methods for Finite State Systems, Proc. Int. Workshop, Grenoble, volume 407 of Lecture Notes in Computer Science, pages 68--80, Grenoble, June 1989. Springer-Verlag.

• Martín Abadi, Leslie Lamport, and Pierre Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Int. Colloquium on Automata, Languages and Programming, volume 372 of Lecture Notes in Computer Science, pages 1--17. Springer-Verlag, July 1989.

• Froduald Kabanza, Jean-Marc Stévenne, and Pierre Wolper. Handling infinite temporal data. In Proc. of the 9th ACM Symposium on Principles of Database Systems, pages 392--403, Nashville Tennessee, 1990.

• Marie-Jeanne Toussaint and Pierre Wolper. Reasoning about cryptographic protocols. In J. Feigenbaum and M. Merritt, editors, Distributed Computing and Cryptography, volume 2 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 245--262. American Mathematical Society, 1989.

• Constantin Courcoubetis, Moshe Y. Vardi, Pierre Wolper, and Mihalis Yannakakis. Memory efficient algorithms for the verification of temporal properties. In Proc. 2nd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 233--242, Rutgers, June 1990. Springer-Verlag.

• Marianne Baudinet, Marc Niézette, and Pierre Wolper. On the representation of infinite temporal data and queries. In Proc. of the 10thth ACM Symposium on Principles of Database Systems, pages 280--290, Denver, Collorado, 1991.

• Patrice Godefroid and Pierre Wolper. A partial approach to model checking. In Proc. 6th Symp. on Logic in Computer Science, pages 406--415, Amsterdam, July 1991.

• Patrice Godefroid and Pierre Wolper. Using partial orders for the efficient verification of deadlock freedom and safety properties. In Proc. 3rd Workshop on Computer Aided Verification, volume 575 of Lecture Notes in Computer Science, pages 332--342, Aalborg, July 1991. Springer-Verlag.

• Pierre Wolper and Patrice Godefroid. Partial-order methods for temporal verification. In Proc. CONCUR '93, volume 715 of Lecture Notes in Computer Science, pages 233--246, Hildesheim, August 1993. Springer-Verlag.

• Pierre Wolper and Denis Leroy. Reliable hashing without collision detection. In Computer Aided Verification, Proc. 5th Int. Workshop, volume 697 of Lecture Notes in Computer Science, pages 59--70, Elounda, Crete, June 1993. Springer-Verlag.

• Marianne Baudinet, Jan Chomicki, and Pierre Wolper. Temporal databases: Beyond finite extensions (position paper). In R. Snodgrass, editor, Proceedings of the International Workshop on an Infrastructure for Temporal Databases, Arlington, Texas, June 1993.

• Bernard Boigelot and Pierre Wolper. Symbolic verification with periodic sets. In Computer Aided Verification, Proc. 6th Int. Conference, volume 818 of Lecture Notes in Computer Science, pages 55--67, Stanford, California, June 1994. Springer-Verlag.

• Orna Bernholtz, Moshe Y. Vardi, and Pierre Wolper. An automata-theoretic approach to branching-time model checking. In Computer Aided Verification, Proc. 6th Int. Workshop, volume 818 of Lecture Notes in Computer Science, pages 142--155, Stanford, California, June 1994. Springer-Verlag.

• Marianne Baudinet, Jan Chomicki, and Pierre Wolper. Constraint-generating dependencies. In Proceedings 5th International Conference on Database Theory (ICDT), pages 322--337, Prague, January 1995. Springer-Verlag.

• Pierre Wolper and Bernard Boigelot. An automata-theoretic approach to presburger arithmetic constraints. In Proc. Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 21--32, Glasgow, September 1995. Springer-Verlag.

• Rob Gerth, Doron Peled, Moshe Y. Vardi, and Pierre Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proc. 15th Work. Protocol Specification, Testing, and Verification, Warsaw, June 1995. North-Holland.

• Bernard Willems and Pierre Wolper. Partial-order methods for model checking: From linear time to branching time. In Proc. 11th Symp. on Logic in Computer Science, pages 294--303, New Brunswick, July 1996.

• Doron Peled, Thomas Wilke, and Pierre Wolper. An algorithmic approach for checking closure properties of omega-regular languages. In Proc. CONCUR '96, volume 1119 of Lecture Notes in Computer Science, pages 596--610, Pisa, August 1996. Springer-Verlag.

• Ulrich Nitsche and Pierre Wolper. Relative liveness and behavior abstraction. In Proc. 16th ACM Symposium on Principles of Distributed Computing, Santa Barbara, August 1997.

• Bernard Boigelot, Patrice Godefroid, Bernard Willems, and Pierre Wolper. The power of qdd's. In Proc. of Int. Static Analysis Symposium, volume 1302 of Lecture Notes in Computer Science, pages 172--186, Paris, September 1997. Springer-Verlag.

• Alain Finkel, Bernard Willems, and Pierre Wolper. A direct symbolic approach to model checking pushdown systems. In Faron Moller, editor, Infinity'97, Second International Workshop on Verification of Infinite State Systems, volume~9 of Electronic Notes in Theoretical Computer Science, Bologna, July 1997. Elsevier Science Publishers.

• Bernard Boigelot, Stéphane Rassart, and Pierre Wolper. On the expressiveness of real and integer arithmetic automata. In Proc. 25th Colloq. on Automata, Programming, and Languages (ICALP), volume 1443 of Lecture Notes in Computer Science, pages 152--163. Springer-Verlag, July 1998.

• Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 88--97, Vancouver, July 1998. Springer-Verlag.

• Pierre Wolper and Bernard Boigelot. On the construction of automata from linear arithmetic constraints. In Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, pages 1--19, Berlin, March 2000. Springer-Verlag.

• Pierre Wolper. Constructing automata from temporal logic formulas: A tutorial. In Lectures on Formal Methods in Performance Analysis (First EEF/Euro Summer School on Trends in Computer Science), volume 2090 of Lecture Notes in Computer Science, pages 261--277. Springer-Verlag, July 2001.

• Bernard Boigelot, Sébastien Jodogne, and Pierre Wolper. On the use of weak automata for deciding linear arithmetic with integer and real variables. In Proc. International Joint Conference on Automated Reasoning (IJCAR), volume 2083 of Lecture Notes in Computer Science, pages 611--625, Siena, June 2001. Springer-Verlag.

• Bernard Boigelot and Pierre Wolper. Representing arithmetic constraints with finite automata: An overview. In Proc. International Conference on Logic Programming (ICLP), volume 2401 of Lecture Notes in Computer Science, pages 1-19, Copenhagen, July 2002. Springer-Verlag.

• Bernard Boigelot, Axel Legay, and Pierre Wolper. Iterating transducers in the large. In Proc. 15th Int. Conf. on Computer Aided Verification , Lecture Notes in Computer Science , pages 223--235 Boulder, July 2003. Springer-Verlag.

• Bernard Boigelot, Axel Legay, and Pierre Wolper. Omega-regular model checking. In Tools and Algorithms for the Construction and Analysis of Systems,10th International Conference, TACAS 2004, volume 2988 of Lecture Notes in Computer Science , pages 561--575, Barcelona, Spain, March 2004. Springer-Verlag.

• Ahmed Bouajjani, Axel Legay, and Pierre Wolper. Handling liveness properties in (omega-)regular model checking. In Proceedings of the 6th International Workshop on Verification of Infinite-State Systems (INFINITY 2004), volume 138 of Electr. Notes Theor. Comput. Sci., pages 101-115, 2005.

• Axel Legay and Pierre Wolper. On the use of automata-based techniques in symbolic model checking: Invited address. In Proceedings of the First International Workshop on Coordination band Organisation (CoOrg 2005), volume 150 of Electr. Notes Theor. Comput. Sci., pages 3--8, 2006.

• François Cantin, Axel Legay, and Pierre Wolper. Computing convex hulls by automata iteration. In Implementation and Applications of Automata, 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings , volume 5148 of Lecture Notes in Computer Science, pages 112--121. Springer, 2008.

Links

• Pierre Wolper
• Pierre Wolper - Bibliography