Pierre Wolper

Q: What Schools Are Affiliated With Pierre Wolper

Pierre Wolper is affiliated with the following schools: University of Liège, Stanford University

Pierre Wolper's AcademicInfluence.com Rankings

Pierre Wolper

Computer Science

#2334

World Rank

#2432

Historical Rank

Database

#4329

World Rank

#4502

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Pierre Wolper's Degrees

PhD Computer Science University of Liège
Masters Computer Science University of Liège

Similar Degrees You Can Earn

Why Is Pierre Wolper Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Pierre Wolper is a Belgian computer scientist at the University of Liège. His research interests include verification methods for reactive and concurrent programs, as well as temporal databases. He is the co-recipient of the 2000 Gödel Prize, along with Moshe Y. Vardi, for his work on temporal logic with finite automata. He also received the 2005 Paris Kanellakis Award for this work.

(See a Problem?)

Pierre Wolper's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) (1986) (1772)
Reasoning About Infinite Computations (1994) (903)
Simple on-the-fly automatic verification of linear temporal logic (1995) (856)
Temporal logic can be more expressive (1981) (852)
An automata-theoretic approach to branching-time model checking (2000) (668)
Automata-Theoretic Techniques for Modal Logics of Programs (1986) (602)
Memory-efficient algorithms for the verification of temporal properties (1990) (601)
Synthesis of Communicating Processes from Temporal Logic Specifications (1981) (542)
The Complementation Problem for Büchi Automata with Appplications to Temporal Logic (1987) (453)
Using partial orders for the efficient verification of deadlock freedom and safety properties (1991) (394)
Reasoning about infinite computation paths (1983) (331)
A partial approach to model checking (1991) (326)
The tableau method for temporal logic: an overview (1985) (320)
Expressing interesting properties of programs in propositional temporal logic (1986) (312)
Realizable and Unrealizable Specifications of Reactive Systems (1989) (282)
Verifying Properties of Large Sets of Processes with Network Invariants (1990) (267)
A direct symbolic approach to model checking pushdown systems (1997) (230)
Verifying Systems with Infinite but Regular State Spaces (1998) (177)
Reliable Hashing without Collosion Detection (1993) (176)
Partial-Order Methods for Temporal Verification (1993) (174)
Symbolic Verification with Periodic Sets (1994) (153)
Handling infinite temporal data (1990) (143)
On the Relation of Programs and Computations to Models of Temporal Logic (1987) (131)
Constructing Automata from Temporal Logic Formulas: A Tutorial (2002) (130)
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) (1995) (113)
On the Construction of Automata from Linear Arithmetic Constraints (2000) (108)
The Power of QDDs (1997) (96)
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) (1994) (89)
A temporal logic for reasoning about partially ordered computations (Extended Abstract) (1984) (85)
Constraint-Generating Dependencies (1994) (84)
Yet Another Process Logic (Preliminary Version) (1983) (82)
Temporal Deductive Databases (1993) (80)
The Power of QDDs (Extended Abstract) (1997) (79)
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) (1998) (78)
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) (1985) (78)
An effective decision procedure for linear arithmetic over the integers and reals (2005) (73)
Automata theoretic techniques for modal logics of programs: (Extended abstract) (1984) (70)
Iterating Transducers in the Large (Extended Abstract) (2003) (63)
On the representation of infinite temporal data and queries (extended abstract) (1991) (61)
Iterating transducers in the large (2003) (58)
Representing Arithmetic Constraints with Finite Automata: An Overview (2002) (54)
Specification and synthesis of communicating processes using an extended temporal logic: (preliminary version) (1982) (52)
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables (2001) (52)
Adding liveness properties to coupled finite-state machines (1990) (46)
Partial-order methods for model checking: from linear time to branching time (1996) (45)
A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems (2011) (45)
An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages (1998) (44)
Memory-Ecient Algorithms for the Verication of Temporal Properties (1992) (42)
An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models (2010) (42)
Reasoning about Infinite Computation Paths (Extended Abstract) (1983) (39)
A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems (2013) (37)
Reasoning about fair concurrent programs (1986) (35)
An efficient automata approach to some problems on context-free grammars (2000) (33)
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages (1996) (31)
Relative liveness and behavior abstraction (extended abstract) (1997) (28)
Handling Liveness Properties in (omega-)Regular Model Checking (2005) (23)
The meaning of “formal”: from weak to strong formal methods (1997) (20)
Omega-Regular Model Checking (2004) (17)
On (Omega-)regular model checking (2008) (17)
Handling Liveness Properties in ( ω-) Regular Model Checking (2004) (17)
Reasoning about Cryptographic Protocols (1989) (14)
Introduction à la Calculabilit́e (2001) (11)
Computing Convex Hulls by Automata Iteration (2008) (10)
Temporal Databases: Beyond Finite Extensions (position paper) (1993) (7)
Relative Liveness and Behavior Abstraction (1997) (6)
The meaning of “formal” (1996) (5)
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables (2003) (5)
Temporal Deductive Databases [chap. 13] (1993) (4)
Proceedings of the 7th International Conference on Computer Aided Verification (1995) (4)
Checking Properties within Fairness and Behavior Abstractions (2001) (3)
Where is the algorithmic support? (1996) (2)
On the Use of Automata for Deciding Linear Arithmetic (2009) (2)
Checking Properties within Fairness and Behavior Abstraction (2001) (2)
An Efficient Automata Approach to Some . . . (2000) (2)
A Framework to Handle Linear Temporal Properties in (\omega-)Regular Model Checking (2009) (2)
On the Sets of Real Vectors Recognized by Finite Automata in Multiple Bases (2011) (2)
An Algorithmic Approach for Checking ClosureProperties of !-Regular (1995) (1)
Computer Aided Verification: 7th International Conference, CAV '95, Liege, Belgium, July 3 - 5, 1995. Proceedings (1995) (1)
Algorithms for Synthesizing Reactive Systems: A Perspective (Abstract) (1998) (1)
Computer-Aided Verification, Proc. 7th Int. Conference (1995) (1)
Representing periodic temporal information with automata (2001) (1)
Linear Repeating Points (2000) (1)
Formal methods and tools for the development of distributed and real time systems : Esprit Project 3096 (SPEC) (1990) (1)
Formal Methods and Tools for the Development of Distributed and Real Time Systems: SPEC -- Esprit Project 3096 (Extended Abstract) (1990) (1)
A Framework To Handle Linear Temporal Properties in (ω-)Regular Model Checking ⋆ (2008) (1)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
Preface -- Workshop Trustworthy Software 2006 (2006) (0)
Workshop "Trustworthy Software" 2006, May 18-19, 2006, Saarland University, Saarbrücken, Germany (2006) (0)
Collection Workshop Trustworthy Software 2006 INTERREG IIIC / e-Bird (2006) (0)
The Power of QDDs ( DRAFT ) (1997) (0)
On the Use of Automata-based Techniques in Symbolic Model Checking: Invited Address (2006) (0)
1 Realizable and Unrealizable Specifications of Reactive Systems (2000) (0)
Abstracts Collection -- Workshop Trustworthy Software 2006 (2006) (0)
Preliminary Version Handling Liveness Properties in ( ω-) Regular Model Checking (2004) (0)
EPTCS 99 Proceedings First Workshop on GRAPH Inspection and Traversal Engineering (2012) (0)
TEMIJORAL IIOGIC CAN DE MOREEXPRESSWE (1981) (0)
2018 CAV award (2021) (0)
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII (1993) (0)
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 (1993) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
13th Intern. Symposium on Protocol Specification, Testing and Verification, Liège, Belgium (1993) (0)
Logic Without Formulas: Automata as a Computational Notation: Invited Presentation at the First Workshop on GRAPH Inspection and Traversal Engineering (2012) (0)
2018 CAV award (2021) (0)
Preliminary Version On the use of Automata-based Techniques in Symbolic Model Checking (2008) (0)
Linear Repeating Points [chap. 13] (2000) (0)
Computer Aided Verification (1995) (0)

This paper list is powered by the following services:

Other Resources About Pierre Wolper

What Schools Are Affiliated With Pierre Wolper?

Pierre Wolper is affiliated with the following schools:

Pierre Wolper's Academic­Influence.com Rankings