Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Pierre Wolper
2010 – today
- 2013
[c48]Alexander Linden, Pierre Wolper: A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems. TACAS 2013: 339-353- 2011
[c47]Alexander Linden, Pierre Wolper: A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems. SPIN 2011: 144-160- 2010
[j24]Axel Legay, Pierre Wolper: On (Omega-)regular model checking. ACM Trans. Comput. Log. 12(1): 2 (2010)
[c46]Alexander Linden, Pierre Wolper: An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models. SPIN 2010: 212-226
2000 – 2009
- 2009
[j23]François Cantin, Axel Legay, Pierre Wolper: Computing Convex Hulls by Automata Iteration. Int. J. Found. Comput. Sci. 20(4): 647-667 (2009)
[c45]
[i4]Ahmed Bouajjani, Axel Legay, Pierre Wolper: A Framework to Handle Linear Temporal Properties in (\omega-)Regular Model Checking. CoRR abs/0901.4080 (2009)- 2008
[c44]François Cantin, Axel Legay, Pierre Wolper: Computing Convex Hulls by Automata Iteration. CIAA 2008: 112-121
[i3]- 2006
[j22]Axel Legay, Pierre Wolper: On the Use of Automata-based Techniques in Symbolic Model Checking: Invited Address. Electr. Notes Theor. Comput. Sci. 150(1): 3-8 (2006)
[c43]Serge Autexier, Stephan Merz, Leendert W. N. van der Torre, Reinhard Wilhelm, Pierre Wolper: Preface -- Workshop Trustworthy Software 2006. Trustworthy Software 2006
[e3]Serge Autexier, Stephan Merz, Leendert W. N. van der Torre, Reinhard Wilhelm, Pierre Wolper (Eds.): Workshop "Trustworthy Software" 2006, May 18-19, 2006, Saarland University, Saarbrücken, Germany. OASICS 3, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006- 2005
[j21]Ahmed Bouajjani, Axel Legay, Pierre Wolper: Handling Liveness Properties in (omega-)Regular Model Checking. Electr. Notes Theor. Comput. Sci. 138(3): 101-115 (2005)
[j20]Bernard Boigelot, Sébastien Jodogne, Pierre Wolper: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans. Comput. Log. 6(3): 614-633 (2005)- 2004
[c42]- 2003
[c41]Bernard Boigelot, Axel Legay, Pierre Wolper: Iterating Transducers in the Large (Extended Abstract). CAV 2003: 223-235
[i2]Bernard Boigelot, Sébastien Jodogne, Pierre Wolper: An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables. CoRR cs.LO/0303019 (2003)- 2002
[c40]Bernard Boigelot, Pierre Wolper: Representing Arithmetic Constraints with Finite Automata: An Overview. ICLP 2002: 1-19- 2001
[j19]
[c39]Bernard Boigelot, Sébastien Jodogne, Pierre Wolper: On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables. IJCAR 2001: 611-625
[c38]
[i1]Ulrich Ultes-Nitsche, Pierre Wolper: Checking Properties within Fairness and Behavior Abstractions. CoRR cs.LO/0101017 (2001)- 2000
[j18]Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper: An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. 74(5-6): 221-227 (2000)
[j17]Orna Kupferman, Moshe Y. Vardi, Pierre Wolper: An automata-theoretic approach to branching-time model checking. J. ACM 47(2): 312-360 (2000)
[c37]
[c36]Pierre Wolper: Constructing Automata from Temporal Logic Formulas: A Tutorial. European Educational Forum: School on Formal Methods and Performance Analysis 2000: 261-277
[c35]Pierre Wolper, Bernard Boigelot: On the Construction of Automata from Linear Arithmetic Constraints. TACAS 2000: 1-19
1990 – 1999
- 1999
[j16]Marianne Baudinet, Jan Chomicki, Pierre Wolper: Constraint-Generating Dependencies. J. Comput. Syst. Sci. 59(1): 94-115 (1999)- 1998
[j15]Doron Peled, Thomas Wilke, Pierre Wolper: An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. Theor. Comput. Sci. 195(2): 183-203 (1998)
[c34]Pierre Wolper, Bernard Boigelot: Verifying Systems with Infinite but Regular State Spaces. CAV 1998: 88-97
[c33]Bernard Boigelot, Stéphane Rassart, Pierre Wolper: On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). ICALP 1998: 152-163
[c32]Pierre Wolper: Algorithms for Synthesizing Reactive Systems: A Perspective (Abstract). LOPSTR 1998: 308- 1997
[j14]Alain Finkel, Bernard Willems, Pierre Wolper: A direct symbolic approach to model checking pushdown systems. Electr. Notes Theor. Comput. Sci. 9: 27-37 (1997)
[j13]
[c31]Ulrich Nitsche, Pierre Wolper: Relative Liveness and Behavior Abstraction (Extended Abstract). PODC 1997: 45-52
[c30]Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper: The Power of QDDs (Extended Abstract). SAS 1997: 172-186- 1996
[j12]
[j11]
[c29]Doron Peled, Thomas Wilke, Pierre Wolper: An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. CONCUR 1996: 596-610
[c28]Bernard Willems, Pierre Wolper: Partial-Order Methods for Model Checking: From Linear Time to Branching Time. LICS 1996: 294-303- 1995
[j10]Froduald Kabanza, Jean-Marc Stévenne, Pierre Wolper: Handling Infinite Temporal Data. J. Comput. Syst. Sci. 51(1): 3-17 (1995)
[c27]Marianne Baudinet, Jan Chomicki, Pierre Wolper: Constraint-Generating Dependencies. ICDT 1995: 322-337
[c26]Rob Gerth, Doron Peled, Moshe Y. Vardi, Pierre Wolper: Simple on-the-fly automatic verification of linear temporal logic. PSTV 1995: 3-18
[c25]Pierre Wolper, Bernard Boigelot: An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract). SAS 1995: 21-32
[e2]Pierre Wolper (Ed.): Computer Aided Verification, 7th International Conference, Liège, Belgium, July, 3-5, 1995, Proceedings. Lecture Notes in Computer Science 939, Springer 1995, ISBN 3-540-60045-0- 1994
[j9]Patrice Godefroid, Pierre Wolper: A Partial Approach to Model Checking. Inf. Comput. 110(2): 305-326 (1994)
[j8]Moshe Y. Vardi, Pierre Wolper: Reasoning About Infinite Computations. Inf. Comput. 115(1): 1-37 (1994)
[c24]
[c23]Orna Bernholtz, Moshe Y. Vardi, Pierre Wolper: An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract). CAV 1994: 142-155
[c22]Marianne Baudinet, Jan Chomicki, Pierre Wolper: Constraint-Generating Dependencies. PPCP 1994: 205-217- 1993
[j7]Patrice Godefroid, Pierre Wolper: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. Formal Methods in System Design 2(2): 149-164 (1993)
[p1]Marianne Baudinet, Jan Chomicki, Pierre Wolper: Temporal Deductive Databases. Temporal Databases 1993: 294-320
[c21]
[c20]Pierre Wolper, Patrice Godefroid: Partial-Order Methods for Temporal Verification. CONCUR 1993: 233-246
[e1]André A. S. Danthine, Guy Leduc, Pierre Wolper (Eds.): Protocol Specification, Testing and Verification XIII, Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification, Liège, Belgium, 25-28 May, 1993. IFIP Transactions C-16, North-Holland 1993, ISBN 0-444-81648-8- 1992
[j6]Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis: Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design 1(2/3): 275-288 (1992)- 1991
[c19]Patrice Godefroid, Pierre Wolper: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. CAV 1991: 332-342
[c18]
[c17]Marianne Baudinet, Marc Niézette, Pierre Wolper: On the Representation of Infinite Temporal Data and Queries. PODS 1991: 280-290- 1990
[j5]Sudhir Aggarwal, Costas Courcoubetis, Pierre Wolper: Adding Liveness Properties to Coupled Finite-State Machines. ACM Trans. Program. Lang. Syst. 12(2): 303-339 (1990)
[c16]Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis: Memory Efficient Algorithms for the Verification of Temporal Properties. CAV 1990: 233-242
[c15]Froduald Kabanza, Jean-Marc Stévenne, Pierre Wolper: Handling Infinite Temporal Data. PODS 1990: 392-403
1980 – 1989
- 1989
[c14]Pierre Wolper, Vinciane Lovinfosse: Verifying Properties of Large Sets of Processes with Network Invariants. Automatic Verification Methods for Finite State Systems 1989: 68-80
[c13]Martín Abadi, Leslie Lamport, Pierre Wolper: Realizable and Unrealizable Specifications of Reactive Systems. ICALP 1989: 1-17- 1987
[j4]A. Prasad Sistla, Moshe Y. Vardi, Pierre Wolper: The Complementation Problem for Büchi Automata with Appplications to Temporal Logic. Theor. Comput. Sci. 49: 217-237 (1987)
[c12]Pierre Wolper: On the Relation of Programs and Computations to Models of Temporal Logic. Temporal Logic in Specification 1987: 75-123- 1986
[j3]Moshe Y. Vardi, Pierre Wolper: Automata-Theoretic Techniques for Modal Logics of Programs. J. Comput. Syst. Sci. 32(2): 183-221 (1986)
[c11]Moshe Y. Vardi, Pierre Wolper: An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report). LICS 1986: 332-344
[c10]Pierre Wolper: Expressing Interesting Properties of Programs in Propositional Temporal Logic. POPL 1986: 184-193
[c9]Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper: Reasoning about Fair Concurrent Programs. STOC 1986: 283-294- 1985
[c8]A. Prasad Sistla, Moshe Y. Vardi, Pierre Wolper: The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract). ICALP 1985: 465-474- 1984
[j2]Zohar Manna, Pierre Wolper: Synthesis of Communicating Processes from Temporal Logic Specifications. ACM Trans. Program. Lang. Syst. 6(1): 68-93 (1984)
[c7]Shlomit S. Pinter, Pierre Wolper: A Temporal Logic for Reasoning about Partially Ordered Computations (Extended Abstract). PODC 1984: 28-37
[c6]Moshe Y. Vardi, Pierre Wolper: Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract). STOC 1984: 446-456- 1983
[j1]
[c5]Pierre Wolper, Moshe Y. Vardi, A. Prasad Sistla: Reasoning about Infinite Computation Paths (Extended Abstract). FOCS 1983: 185-194
[c4]Moshe Y. Vardi, Pierre Wolper: Yet Another Process Logic (Preliminary Version). Logic of Programs 1983: 501-512- 1982
[c3]Pierre Wolper: Specification and Synthesis of Communicating Processes using an Extended Temporal Logic. POPL 1982: 20-33- 1981
[c2]
[c1]Zohar Manna, Pierre Wolper: Synthesis of Communicating Processes from Temporal Logic Specifications. Logic of Programs 1981: 253-281
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-19 20:09 CET by the dblp team



