Pierre Wolper - Recent Publications
(.bib file with the complete references of these and other papers).
On the Representation of Infinite Temporal Data and Queries
(PODS '91 paper with coauthors M. Baudinet and M. Niezette).
Memory-Efficient Algorithms for the Verification of Temporal Properties
(FMSD paper with coauthors C. Courcoubetis, M. Vardi, and M. Yannakakis).
Reliable Hashing Without Collision Detection
(CAV'93 paper with coauthor D. Leroy).
Partial-Order Methods for Temporal Verification
(CONCUR '93 invited paper with coauthor P. Godefroid).
An Automata-Theoretic Approach to Branching-Time Model Checking
(CAV'94 paper with coauthors O. Bernholtz and M. Vardi).
A Partial Approach To Model Checking
(Information and Computation paper with coauthor P. Godefroid).
Constraint Generating Dependencies
(ICDT'95 paper with coauthors M. Baudinet and J. Chomicki).
An Automata-Theoretic Approach to Presburger Arithmetic Constraints
(SAS'95 invited paper with coauthor B. Boigelot).
Simple On-the-fly Automatic Verification of Linear Temporal Logic
(PSTV'95 paper with coauthors R. Gerth, D. Peled and M. Y. Vardi).
Handling infinite temporal data
(JCSS paper with coauthors F. Kabanza and J.-M. Stevenne).
An Introduction to Model Checking
(SQW '95 Introduction to a Panel on Model Checking).
Partial-Order Methods for Model Checking: From Linear Time to Branching Time
(LICS '96 paper with coauthor B. Willems).
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages
(CONCUR '96 paper with coauthors D. Peled and T. Wilke).
Relative Liveness and Behavior Abstraction
(PODC '97 paper with coauthor U. Nitsche).
The Power of QDD's
(SAS '97 paper with coauthors B. Boigelot, P. Godefroid and B. Willems).
Draft full version
A Direct Symbolic Approach to Model Checking Pushdown Systems
(Infinity '97 paper with coauthors A. Finkel and B. Willems).
The meaning of ``Formal'': from Weak to Strong Formal Methods
(To appear in Software Tools for Technology Transfer).
On the expressiveness of real and integer arithmetic automata.
(ICALP 98 paper with coauthors Bernard Boigelot and Stéphane Rassart.
Verifying systems with infinite but regular state spaces.
(CAV 98 paper with coauthor Bernard Boigelot).
On the construction of automata from linear arithmetic constraints.
(TACAS 2000 paper with coauthor Bernard Boigelot).
Constructing Automata from Temporal Logic Formulas: A Tutorial
(To appear in the proceedings of the FMPA 2000 summer school).
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
(To appear in the proceedings of the IJCAR 2001 conference).
Representing Arithmetic Constraints with Automata: An Overview
(To appear in the proceedings of the ICLP02 conference).
Iterating Transducers in the Large
(CAV 2003 paper with Bernard Boigelot and Axel Legay)
email@example.com Tue Apr 1 10:51:41 CEST 2003