Pierre Wolper

According to our database1, Pierre Wolper authored at least 79 papers between 1981 and 2013.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2013
A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

2011
A Verification-Based Approach to Memory Fence Insertion in Relaxed Memory Systems.
Proceedings of the Model Checking Software, 2011

2010
On (Omega-)regular model checking.
ACM Trans. Comput. Log., 2010

An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models.
Proceedings of the Model Checking Software, 2010

2009
Computing Convex Hulls by Automata Iteration.
Int. J. Found. Comput. Sci., 2009

A Framework to Handle Linear Temporal Properties in (\omega-)Regular Model Checking
CoRR, 2009

On the Use of Automata for Deciding Linear Arithmetic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

2008
On (Omega-)Regular Model Checking
CoRR, 2008

Computing Convex Hulls by Automata Iteration.
Proceedings of the Implementation and Applications of Automata, 2008

2006
On the Use of Automata-based Techniques in Symbolic Model Checking: Invited Address.
Electr. Notes Theor. Comput. Sci., 2006

Preface -- Workshop Trustworthy Software 2006.
Proceedings of the Workshop "Trustworthy Software" 2006, 2006

2005
An effective decision procedure for linear arithmetic over the integers and reals.
ACM Trans. Comput. Log., 2005

Handling Liveness Properties in (omega-)Regular Model Checking.
Electr. Notes Theor. Comput. Sci., 2005

2004
Omega-Regular Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

2003
An Effective Decision Procedure for Linear Arithmetic with Integer and Real Variables
CoRR, 2003

Iterating Transducers in the Large (Extended Abstract).
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
Representing Arithmetic Constraints with Finite Automata: An Overview.
Proceedings of the Logic Programming, 18th International Conference, 2002

2001
Module Checking.
Inf. Comput., 2001

Checking Properties within Fairness and Behavior Abstractions
CoRR, 2001

Representing Periodic Temporal Information with Automata.
Proceedings of the Eigth International Symposium on Temporal Representation and Reasoning, 2001

On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000
An automata-theoretic approach to branching-time model checking.
J. ACM, 2000

An efficient automata approach to some problems on context-free grammars.
Inf. Process. Lett., 2000

On the Construction of Automata from Linear Arithmetic Constraints.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

Constructing Automata from Temporal Logic Formulas: A Tutorial.
Proceedings of the Lectures on Formal Methods and Performance Analysis, 2000

Linear Repeating Points.
Constraint Databases, 2000

1999
Constraint-Generating Dependencies.
J. Comput. Syst. Sci., 1999

1998
An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages.
Theor. Comput. Sci., 1998

Algorithms for Synthesizing Reactive Systems: A Perspective (Abstract).
Proceedings of the Logic Programming Synthesis and Transformation, 1998

On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Verifying Systems with Infinite but Regular State Spaces.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997
The Meaning of "Formal": From Weak to Strong Formal Methods.
STTT, 1997

A direct symbolic approach to model checking pushdown systems.
Electr. Notes Theor. Comput. Sci., 1997

The Power of QDDs (Extended Abstract).
Proceedings of the Static Analysis, 4th International Symposium, 1997

Relative Liveness and Behavior Abstraction (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
The Meaning of "Formal".
ACM Comput. Surv., 1996

Where is the Algorithmic Support?
ACM Comput. Surv., 1996

Partial-Order Methods for Model Checking: From Linear Time to Branching Time.
Proceedings of the Proceedings, 1996

An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages.
Proceedings of the CONCUR '96, 1996

1995
Handling Infinite Temporal Data.
J. Comput. Syst. Sci., 1995

An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
Proceedings of the Static Analysis, 1995

Simple on-the-fly automatic verification of linear temporal logic.
Proceedings of the Protocol Specification, 1995

Constraint-Generating Dependencies.
Proceedings of the Database Theory, 1995

1994
Reasoning About Infinite Computations
Inf. Comput., November, 1994

A Partial Approach to Model Checking
Inf. Comput., May, 1994

Constraint-Generating Dependencies.
Proceedings of the Principles and Practice of Constraint Programming, 1994

Symbolic Verification with Periodic Sets.
Proceedings of the Computer Aided Verification, 6th International Conference, 1994

An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract).
Proceedings of the Computer Aided Verification, 6th International Conference, 1994

1993
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties.
Formal Methods in System Design, 1993

Partial-Order Methods for Temporal Verification.
Proceedings of the CONCUR '93, 1993

Reliable Hashing without Collosion Detection.
Proceedings of the Computer Aided Verification, 5th International Conference, 1993

Temporal Deductive Databases.
Temporal Databases, 1993

1992
Memory-Efficient Algorithms for the Verification of Temporal Properties.
Formal Methods in System Design, 1992

1991
On the Representation of Infinite Temporal Data and Queries.
Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1991

A Partial Approach to Model Checking
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties.
Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991

1990
Adding Liveness Properties to Coupled Finite-State Machines.
ACM Trans. Program. Lang. Syst., 1990

Handling Infinite Temporal Data.
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990

Memory Efficient Algorithms for the Verification of Temporal Properties.
Proceedings of the Computer-Aided Verification, 1990

Memory Efficient Algorithms for the Verification of Temporal Properties.
Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

1989
Realizable and Unrealizable Specifications of Reactive Systems.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Reasoning about Cryptographic Protocols.
Proceedings of the Distributed Computing And Cryptography, 1989

Verifying Properties of Large Sets of Processes with Network Invariants.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1987
The Complementation Problem for Büchi Automata with Appplications to Temporal Logic.
Theor. Comput. Sci., 1987

On the Relation of Programs and Computations to Models of Temporal Logic.
Proceedings of the Temporal Logic in Specification, 1987

1986
Automata-Theoretic Techniques for Modal Logics of Programs.
J. Comput. Syst. Sci., 1986

Reasoning about Fair Concurrent Programs
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Expressing Interesting Properties of Programs in Propositional Temporal Logic.
Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract).
Proceedings of the Automata, 1985

1984
Synthesis of Communicating Processes from Temporal Logic Specifications.
ACM Trans. Program. Lang. Syst., 1984

Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract)
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

A Temporal Logic for Reasoning about Partially Ordered Computations (Extended Abstract).
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1983
Temporal Logic Can Be More Expressive
Information and Control, 1983

Yet Another Process Logic (Preliminary Version).
Proceedings of the Logics of Programs, 1983

Reasoning about Infinite Computation Paths (Extended Abstract)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
Specification and Synthesis of Communicating Processes using an Extended Temporal Logic.
Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

1981
Synthesis of Communicating Processes from Temporal Logic Specifications.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

Temporal Logic Can Be More Expressive
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981


  Loading...