Publications and communications of Wolper, Pierre

Linden, A., & Wolper, P. (2013). A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems. In Proceedings of the 19th international conference on Tools and algorithms for the construction and analysis of systems (pp. 339-353). Springer. doi:10.1007/978-3-642-36742-7_24

Linden, A., & Wolper, P. (2011). A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems. In Model Checking Software , 18th International SPIN Workshop (pp. 144-160). Berlin, Germany: Springer. doi:10.1007/978-3-642-22306-8_10

Linden, A., & Wolper, P. (2010). An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models. Lecture Notes in Computer Science, 212-226. doi:10.1007/978-3-642-16164-3_16

Legay, A., & Wolper, P. (2010). On (Omega-)regular model checking. ACM Transactions on Computational Logic, 12 (1), 46. doi:10.1145/1838552.1838554

Cantin, F., Legay, A., & Wolper, P. (2009). Computing Convex Hulls by Automata Iteration. International Journal of Foundations of Computer Science, 20 (4), 647-667. doi:10.1142/S0129054109006796

Cantin, F., Legay, A., & Wolper, P. (July 2008). Computing Convex Hulls by Automata Iteration. Lecture Notes in Computer Science, 5148, 112-121. doi:10.1007/978-3-540-70844-5_12

Wolper, P. (2006). Automates et vérification. In Encyclopédie de l'informatique et des systèmes d'information (pp. 977--986). Paris, France: Vuibert.

Legay, A., & Wolper, P. (09 March 2006). On the Use of Automata-based Techniques in Symbolic Model Checking: invited address. Electronic Notes in Theoretical Computer Science, 150 (1), 3-8. doi:10.1016/j.entcs.2005.12.020

Wolper, P. (2006). Introduction à la Calculabilit́e. (3e). Dunod.

Bouajjani, A., Legay, A., & Wolper, P. (28 December 2005). Handling Liveness Properties in (ω-)Regular Model Checking. Electronic Notes in Theoretical Computer Science, 138 (3), 101-115. doi:10.1016/j.entcs.2005.02.061

Boigelot, B., Jodogne, S., & Wolper, P. (2005). An effective decision procedure for linear arithmetic over the integers and reals. ACM Transactions on Computational Logic, 6 (3), 614--633. doi:10.1145/1071596.1071601

Boigelot, B., Legay, A., & Wolper, P. (2004). Omega-regular model checking. Lecture Notes in Computer Science, 2988, 561-575. doi:10.1007/978-3-540-24730-2_41

Boigelot, B., Legay, A., & Wolper, P. (2003). Iterating transducers in the large. Lecture Notes in Computer Science, 2725, 223-235. doi:10.1007/978-3-540-45069-6_24

Boigelot, B., & Wolper, P. (July 2002). Representing arithmetic constraints with finite automata: An overview. Lecture Notes in Computer Science, 2401. doi:10.1007/3-540-45619-8_1

Wolper, P. (2001). Representing Periodic Temporal Information with Automata. In Proc. Eighth International Symposium on Temporal Representation and Reasoning (pp. 179). IEEE Computer Society.

Boigelot, B., Jodogne, S., & Wolper, P. (2001). On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables. Lecture Notes in Computer Science, 2083, 611--625. doi:10.1007/3-540-45744-5_50

Kupferman, O., Vardi, M. Y., & Wolper, P. (2001). Module checking. Information and Computation, 164 (2), 322-344. doi:10.1006/inco.2000.2893

Wolper, P. (2001). Introduction à la Calculabilité. (2e). Paris, France: Dunod.

Wolper, P. (2001). Constructing Automata from Temporal Logic Formulas: A Tutorial. Lecture Notes in Computer Science, 2090, 261--277. doi:10.1007/3-540-44667-2_7

Bouajjani, A., Esparza, J., Finkel, A., Maler, O., Rossmanith, P., Willems, B., & Wolper, P. (June 2000). An efficient automata approach to some problems on context-free grammars. Information Processing Letters, 74 (5-6), 221-227. doi:10.1016/S0020-0190(00)00055-7

Wolper, P., & Boigelot, B. (March 2000). On the construction of automata from linear arithmetic constraints. Lecture Notes in Computer Science, 1785, 1-19. doi:10.1007/3-540-46419-0_1

Kupferman, O., Vardi, M. Y., & Wolper, P. (2000). An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47 (2), 312-360. doi:10.1145/333979.333987

Wolper, P. (2000). Linear Repeating Points [chap. 13]. In G. Kuper, L. Libkin, & J. Paredaens (Eds.), Constraint Databases (pp. 305--314). Springer-Verlag.

Baudinet, M., Chomicki, J., & Wolper, P. (1999). Constraint-generating dependencies. Journal of Computer and System Sciences, 59 (1), 94-115. doi:10.1006/jcss.1999.1632

Boigelot, B., Rassart, S., & Wolper, P. (1998). On the Expressiveness of Real and Integer Arithmetic Automata. Lecture Notes in Computer Science, 1443, 152-163. doi:10.1007/bfb0055049

Peled, D., Wilke, T., & Wolper, P. (1998). An algorithmic approach for checking closure properties of temporal logic specifications and ω-regular languages. Theoretical Computer Science, 195 (2), 183--203. doi:10.1016/S0304-3975(97)00219-3

Wolper, P., & Boigelot, B. (1998). Verifying Systems with Infinite but Regular State Spaces. Lecture Notes in Computer Science, 1427, 88-97. doi:10.1007/BFb0028736

Boigelot, B., Godefroid, P., Willems, B., & Wolper, P. (1997). The Power of QDDs. Lecture Notes in Computer Science, 1302, 172-186. doi:10.1007/bfb0032741

Finkel, A., Willems, B., Wolper, P., & Moller, F. (1997). A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science, 9.

Nitsche, U., & Wolper, P. (1997). Relative Liveness and Behavior Abstraction. In Proc. 16th ACM Symposium on Principles of Distributed Computing. ACM.

Wolper, P. (1997). The meaning of formal: from weak to strong formal methods. International Journal on Software Tools for Technology Transfer, 1 (1-2), 6--8. doi:10.1007/s100090050002

Clarke, E. M., Wing, J. M., Alur, R., Cleaveland, R., Dill, D., Emerson, A., Garland, S., German, S., Guttag, J., Hall, A., Henzinger, T., Holzmann, G., Jones, C., Kurshan, R., Leveson, N., McMillan, K., Moore, J., Peled, D., Pnueli, A., & Zave, P. (1996). Formal Methods: State of the Art and Future Directions. ACM Computing Surveys, 28 (4), 626--643. doi:10.1145/242223.242257

Cleaveland, R., Smolka, S. A., Alur, R., Baeten, J., Bergstra, J. A., Best, E., DeNicola, R., Gill, H., Gorrieri, R., Gouda, M. G., Groote, J. F., Henzinger, T. A., Hoare, C. A. R., Luginbuhl, D., Meyer, A., Miller, D., Misra, J., Moller, F., Montanari, U., & Wolper, P. (1996). Strategic directions in concurrency research. ACM Computing Surveys, 28 (4), 607-625. doi:10.1145/242223.242252

Peled, D., Wilke, T., & Wolper, P. (1996). An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. In Proc. CONCUR '96 (pp. 596--610). Springer-Verlag.

Willems, B., & Wolper, P. (1996). Partial-Order Methods for Model Checking: From Linear Time to Branching Time. In Proc. 11th Symp. on Logic in Computer Science (pp. 294--303). IEEE Computer Society.

Wolper, P. (1996). Where is the Algorithmic Support? ACM Computing Surveys, 28 (4es), 58.

Wolper, P. (1996). The Meaning of ``Formal''. ACM Computing Surveys, 28 (4es), 127. doi:10.1145/242224.242386

Baudinet, M., Chomicki, J., & Wolper, P. (1995). Constraint-Generating Dependencies. In Proceedings 5th International Conference on Database Theory (ICDT) (pp. 322--337). Prague, Czechia: Springer-Verlag.

Gerth, R., Peled, D., Vardi, M. Y., & Wolper, P. (1995). Simple On-the-fly Automatic Verification of Linear Temporal Logic. In P. Dembinski & M. Sredniawa (Eds.), Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification. IFIP.

Kabanza, F., Stevenne, J.-M., & Wolper, P. (1995). Handling infinite temporal data. Journal of Computer and System Sciences, 51 (1), 3--17. doi:10.1006/jcss.1995.1049

Wolper, P. (1995). On the Relation of Programs and Computations to Models of Temporal Logic [chap. 3]. In L. Bolc & A. Sza\las (Eds.), Time and Logic, a computational approach (pp. 131--178). UCL Press Limited.

Wolper, P. (Ed.). (1995). Computer-Aided Verification, Proc. 7th Int. Conference. Springer-Verlag.

Wolper, P., & Boigelot, B. (1995). An Automata-Theoretic Approach to Presburger Arithmetic Constraints. Lecture Notes in Computer Science, 983, 21-32. doi:10.1007/3-540-60360-3_30

Bernholtz, O., Vardi, M. Y., & Wolper, P. (1994). An Automata-Theoretic Approach to Branching-Time Model Checking. In Computer Aided Verification, Proc. 6th Int. Workshop (pp. 142--155). Springer-Verlag.

Boigelot, B., & Wolper, P. (1994). Symbolic Verification with Periodic Sets. Lecture Notes in Computer Science, 818, 55-67. doi:10.1007/3-540-58179-0_43

Godefroid, P., & Wolper, P. (1994). A Partial Approach To Model Checking. Information and Computation, 110 (2), 305--326. doi:10.1006/inco.1994.1035

Vardi, M. Y., & Wolper, P. (1994). Reasoning about Infinite Computations. Information and Computation, 115 (1), 1-37. doi:10.1006/inco.1994.1092

Danthine, A., Leduc, G., & Wolper, P. (Eds.). (1993). 13th Intern. Symposium on Protocol Specification, Testing and Verification, Liège, Belgium. North-Holland.

Baudinet, M., Chomicki, J., & Wolper, P. (1993). Temporal Deductive Databases [chap. 13]. In A. U. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, & R. Snodgrass (Eds.), Temporal Databases. Theory, Design, and Implementation (pp. 294--320). Benjamin/Cummings.

Baudinet, M., Chomicki, J., & Wolper, P. (1993). Temporal Databases: Beyond Finite Extensions (position paper). Paper presented at International Woorkshop on an Infrastructure for Temporal Databases.

Godefroid, P., & Wolper, P. (1993). Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. Formal Methods in System Design, 2 (2), 149--164. doi:10.1007/BF01383879

Wolper, P., & Godefroid, P. (1993). Partial-Order Methods for Temporal Verification. In Proc. CONCUR '93 (pp. 233--246). Springer-Verlag.

Wolper, P., & Leroy, D. (1993). Reliable Hashing Without Collision Detection. In Computer Aided Verification, Proc. 5th Int. Workshop (pp. 59-70). Springer-Verlag.

Courcoubetis, C., Vardi, M. Y., Wolper, P., & Yannakakis, M. (1992). Memory Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design, 1, 275--288. doi:10.1007/BF00121128

Baudinet, M., Níezette, M., & Wolper, P. (1991). On the Representation of Infinite Temporal Data and Queries. In Proc. of the 10th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (pp. 280--290). doi:10.1145/113413.113439

Courcoubetis, C., Vardi, M., Wolper, P., & Yannakakis, M. (1991). Memory efficient algorithms for the verification of temporal properties. In Computer-Aided Verification, 2nd International Conference Proceedings (pp. 233-242). Berlin, Germany: Springer. doi:10.1007/BFb0023737

Godefroid, P., & Wolper, P. (1991). Using partial orders for the efficient verification of deadlock freedom and safety properties. In Proc. 3rd Workshop on Computer Aided Verification (pp. 332-342). Aalborg, Denmark: Springer-Verlag.

Godefroid, P., & Wolper, P. (1991). A Partial Approach To Model Checking. In Proceedings 6th IEEE Symposium on Logic in Computer Science (pp. 406--415). New York, United States - New York: IEEE. doi:10.1109/LICS.1991.151664

Abadi, M., Lamport, L., & Wolper, P. (1989). Realizable and Unrealizable Specifications of Reactive Systems. In 16th International Colloquium on Automata, Languages and Programming (pp. 1-17). Berlin, Germany: Springer. doi:10.1007/BFb0035748

Gribomont, P., & Wolper, P. (1989). Temporal Logic. In From Modal Logic to Deductive Databases. John Wiley and Sons.

Wolper, P., & Lovinfosse, V. (1989). Verifying Properties of Large Sets of Processes with Network Invariants. In Automatic Verification Methods for Finite State Systems, Proc. Int. Workshop, Grenoble (pp. 68--80). Springer-Verlag. doi:10.1007/3-540-52148-8_6

Sistla, Vardi, & Wolper, P. (1987). The complementation problem for Buchi automata with applications to temporal logic. Theoretical Computer Science, 49 (2-3), 217-237. doi:10.1016/0304-3975(87)90008-9

Vardi, M. Y., & Wolper, P. (1986). Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences, 32 (2), 183-221. doi:10.1016/0022-0000(86)90026-7

Vardi, M. Y., & Wolper, P. (1986). An Automata-Theoretic Approach to Automatic Program Verification. In Proceedings of the First Symposium on Logic in Computer Science (pp. 322--331). IEEE Computer Society.

Wolper, P. (1985). The Tableau Method for Temporal Logic: An Overview. Logique et Analyse, (110--111), 119--136.

Manna, Z., & Wolper, P. (1984). Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 6 (1), 68-93. doi:10.1145/357233.357237

Vardi, M. Y., & Wolper, P. (1984). Yet Another Process Logic. In E. Clarke & D. Kozen, Logics of Programs (pp. 501--512). Springer-Verlag. doi:10.1007/3-540-12896-4_383

Vardi, M. Y., & Wolper, P. (1984). Automata-Theoretic Techniques for Modal Logics of Programs. In Proc. 16th ACM Symposium on Theory of Computing (pp. 446--456). New York, United States: ACM. doi:10.1145/800057.808711

Wolper, P. (1983). Temporal Logic Can Be More Expressive. Information and Control, 56 (1--2), 72--99. doi:10.1016/S0019-9958(83)80051-5