default search action
Pierre Wolper
Person information
- affiliation: University of Liège, Belgium
- award (2005): Paris Kanellakis Award
- award (2000): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j22]Kim G. Larsen, Natarajan Shankar, Pierre Wolper, Somesh Jha:
2018 CAV award. Formal Methods Syst. Des. 57(1): 116-117 (2021)
2010 – 2019
- 2013
- [c52]Alexander Linden, Pierre Wolper
:
A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems. TACAS 2013: 339-353 - 2011
- [c51]Alexander Linden, Pierre Wolper
A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems. SPIN 2011: 144-160 - 2010
- [j21]Axel Legay, Pierre Wolper
On (Omega-)regular model checking. ACM Trans. Comput. Log. 12(1): 2:1-2:46 (2010) - [c50]Alexander Linden, Pierre Wolper
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models. SPIN 2010: 212-226
2000 – 2009
- 2009
- [j20]François Cantin, Axel Legay, Pierre Wolper
Computing Convex Hulls by Automata Iteration. Int. J. Found. Comput. Sci. 20(4): 647-667 (2009) - [c49]Pierre Wolper:
On the Use of Automata for Deciding Linear Arithmetic. TABLEAUX 2009: 16 - [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
- [c48]François Cantin, Axel Legay, Pierre Wolper
Computing Convex Hulls by Automata Iteration. CIAA 2008: 112-121 - [i3]Axel Legay, Pierre Wolper:
On (Omega-)Regular Model Checking. CoRR abs/0809.2214 (2008) - 2006
- [c47]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:
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 [contents] - 2005
- [j19]Bernard Boigelot, Sébastien Jodogne
An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans. Comput. Log. 6(3): 614-633 (2005) - [c46]Axel Legay, Pierre Wolper
On the Use of Automata-based Techniques in Symbolic Model Checking: Invited Address. MTCoord@COORDINATION 2005: 3-8 - 2004
- [c45]Bernard Boigelot, Axel Legay, Pierre Wolper
Omega-Regular Model Checking. TACAS 2004: 561-575 - [c44]Ahmed Bouajjani, Axel Legay, Pierre Wolper
Handling Liveness Properties in (omega-)Regular Model Checking. INFINITY 2004: 101-115 - 2003
- [c43]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
- [c42]Bernard Boigelot, Pierre Wolper
Representing Arithmetic Constraints with Finite Automata: An Overview. ICLP 2002: 1-19 - 2001
- [j18]Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
Module Checking. Inf. Comput. 164(2): 322-344 (2001) - [c41]Bernard Boigelot, Sébastien Jodogne
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables. IJCAR 2001: 611-625 - [c40]Pierre Wolper:
Representing Periodic Temporal Information with Automata. TIME 2001: 179 - [i1]Ulrich Ultes-Nitsche, Pierre Wolper:
Checking Properties within Fairness and Behavior Abstractions. CoRR cs.LO/0101017 (2001) - 2000
- [j17]Ahmed Bouajjani, Javier Esparza
An efficient automata approach to some problems on context-free grammars. Inf. Process. Lett. 74(5-6): 221-227 (2000) - [j16]Orna Kupferman, Moshe Y. Vardi, Pierre Wolper
An automata-theoretic approach to branching-time model checking. J. ACM 47(2): 312-360 (2000) - [c39]Pierre Wolper
Constructing Automata from Temporal Logic Formulas: A Tutorial. European Educational Forum: School on Formal Methods and Performance Analysis 2000: 261-277 - [c38]Pierre Wolper
On the Construction of Automata from Linear Arithmetic Constraints. TACAS 2000: 1-19 - [p2]Pierre Wolper:
Linear Repeating Points. Constraint Databases 2000: 305-314
1990 – 1999
- 1999
- [j15]Marianne Baudinet, Jan Chomicki, Pierre Wolper
Constraint-Generating Dependencies. J. Comput. Syst. Sci. 59(1): 94-115 (1999) - 1998
- [j14]Doron A. 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) - [c37]Pierre Wolper
Verifying Systems with Infinite but Regular State Spaces. CAV 1998: 88-97 - [c36]Bernard Boigelot, Stéphane Rassart, Pierre Wolper
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). ICALP 1998: 152-163 - [c35]Pierre Wolper:
Algorithms for Synthesizing Reactive Systems: A Perspective (Abstract). LOPSTR 1998: 308 - 1997
- [j13]Pierre Wolper
The Meaning of "Formal": From Weak to Strong Formal Methods. Int. J. Softw. Tools Technol. Transf. 1(1-2): 6-8 (1997) - [c34]Ulrich Nitsche
Relative Liveness and Behavior Abstraction (Extended Abstract). PODC 1997: 45-52 - [c33]Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper
The Power of QDDs (Extended Abstract). SAS 1997: 172-186 - [c32]Alain Finkel, Bernard Willems, Pierre Wolper:
A direct symbolic approach to model checking pushdown systems. INFINITY 1997: 27-37 - 1996
- [j12]Pierre Wolper:
Where is the Algorithmic Support? ACM Comput. Surv. 28(4es): 58 (1996) - [j11]Pierre Wolper:
The Meaning of "Formal". ACM Comput. Surv. 28(4es): 127 (1996) - [c31]Doron A. Peled, Thomas Wilke, Pierre Wolper
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. CONCUR 1996: 596-610 - [c30]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) - [c29]Marianne Baudinet, Jan Chomicki, Pierre Wolper
Constraint-Generating Dependencies. ICDT 1995: 322-337 - [c28]Rob Gerth, Doron A. Peled, Moshe Y. Vardi, Pierre Wolper:
Simple on-the-fly automatic verification of linear temporal logic. PSTV 1995: 3-18 - [c27]Pierre Wolper
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract). SAS 1995: 21-32 - [e2]Pierre Wolper
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 [contents] - 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) - [c26]Bernard Boigelot, Pierre Wolper
Symbolic Verification with Periodic Sets. CAV 1994: 55-67 - [c25]Orna Bernholtz, Moshe Y. Vardi, Pierre Wolper:
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract). CAV 1994: 142-155 - [c24]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 Syst. Des. 2(2): 149-164 (1993) - [c23]Pierre Wolper
Reliable Hashing without Collosion Detection. CAV 1993: 59-70 - [c22]Pierre Wolper
Partial-Order Methods for Temporal Verification. CONCUR 1993: 233-246 - [p1]Marianne Baudinet, Jan Chomicki, Pierre Wolper:
Temporal Deductive Databases. Temporal Databases 1993: 294-320 - [e1]André A. S. Danthine, Guy Leduc, Pierre Wolper:
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 [contents] - 1992
- [j6]Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper
Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods Syst. Des. 1(2/3): 275-288 (1992) - 1991
- [c21]Patrice Godefroid, Pierre Wolper
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. CAV 1991: 332-342 - [c20]Patrice Godefroid, Pierre Wolper:
A Partial Approach to Model Checking. LICS 1991: 406-415 - [c19]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) - [c18]Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper
Memory Efficient Algorithms for the Verification of Temporal Properties. CAV 1990: 233-242 - [c17]Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis:
Memory Efficient Algorithms for the Verification of Temporal Properties. CAV (DIMACS/AMS volume) 1990: 207-218 - [c16]Froduald Kabanza, Jean-Marc Stévenne, Pierre Wolper
Handling Infinite Temporal Data. PODS 1990: 392-403
1980 – 1989
- 1989
- [c15]Pierre Wolper
Verifying Properties of Large Sets of Processes with Network Invariants. Automatic Verification Methods for Finite State Systems 1989: 68-80 - [c14]Marie-Jeanne Toussaint, Pierre Wolper:
Reasoning about Cryptographic Protocols. Distributed Computing And Cryptography 1989: 245- - [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]Pierre Wolper
Temporal Logic Can Be More Expressive. Inf. Control. 56(1/2): 72-99 (1983) - [c5]Pierre Wolper
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
- [b1]Pierre Wolper:
Synthesis of communicating processes from temporal logic specifications. Stanford University, USA, 1982 - [c3]Pierre Wolper
Specification and Synthesis of Communicating Processes using an Extended Temporal Logic. POPL 1982: 20-33 - 1981
- [c2]Pierre Wolper
Temporal Logic Can Be More Expressive. FOCS 1981: 340-348 - [c1]Zohar Manna, Pierre Wolper
Synthesis of Communicating Processes from Temporal Logic Specifications. Logic of Programs 1981: 253-281
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-22 19:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: