| 2009 |
|---|
| 74 | EE | Ahmed Bouajjani,
Axel Legay,
Pierre Wolper:
A Framework to Handle Linear Temporal Properties in (\omega-)Regular Model Checking
CoRR abs/0901.4080: (2009) |
| 2008 |
|---|
| 73 | EE | François Cantin,
Axel Legay,
Pierre Wolper:
Computing Convex Hulls by Automata Iteration.
CIAA 2008: 112-121 |
| 72 | EE | Axel Legay,
Pierre Wolper:
On (Omega-)Regular Model Checking
CoRR abs/0809.2214: (2008) |
| 2006 |
|---|
| 71 | | 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
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 70 | EE | Serge Autexier,
Stephan Merz,
Leendert W. N. van der Torre,
Reinhard Wilhelm,
Pierre Wolper:
Preface -- Workshop Trustworthy Software 2006.
Trustworthy Software 2006 |
| 69 | EE | 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) |
| 2005 |
|---|
| 68 | EE | 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) |
| 67 | EE | Ahmed Bouajjani,
Axel Legay,
Pierre Wolper:
Handling Liveness Properties in (omega-)Regular Model Checking.
Electr. Notes Theor. Comput. Sci. 138(3): 101-115 (2005) |
| 2004 |
|---|
| 66 | EE | Bernard Boigelot,
Axel Legay,
Pierre Wolper:
Omega-Regular Model Checking.
TACAS 2004: 561-575 |
| 2003 |
|---|
| 65 | EE | Bernard Boigelot,
Axel Legay,
Pierre Wolper:
Iterating Transducers in the Large (Extended Abstract).
CAV 2003: 223-235 |
| 64 | EE | 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 |
|---|
| 63 | EE | Bernard Boigelot,
Pierre Wolper:
Representing Arithmetic Constraints with Finite Automata: An Overview.
ICLP 2002: 1-19 |
| 2001 |
|---|
| 62 | EE | 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 |
| 61 | EE | Pierre Wolper:
Representing Periodic Temporal Information with Automata.
TIME 2001: 179 |
| 60 | EE | Ulrich Ultes-Nitsche,
Pierre Wolper:
Checking Properties within Fairness and Behavior Abstractions
CoRR cs.LO/0101017: (2001) |
| 59 | | Orna Kupferman,
Moshe Y. Vardi,
Pierre Wolper:
Module Checking.
Inf. Comput. 164(2): 322-344 (2001) |
| 2000 |
|---|
| 58 | | Pierre Wolper:
Linear Repeating Points.
Constraint Databases 2000: 305-314 |
| 57 | EE | Pierre Wolper:
Constructing Automata from Temporal Logic Formulas: A Tutorial.
European Educational Forum: School on Formal Methods and Performance Analysis 2000: 261-277 |
| 56 | EE | Pierre Wolper,
Bernard Boigelot:
On the Construction of Automata from Linear Arithmetic Constraints.
TACAS 2000: 1-19 |
| 55 | EE | 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) |
| 54 | EE | Orna Kupferman,
Moshe Y. Vardi,
Pierre Wolper:
An automata-theoretic approach to branching-time model checking.
J. ACM 47(2): 312-360 (2000) |
| 1999 |
|---|
| 53 | | Marianne Baudinet,
Jan Chomicki,
Pierre Wolper:
Constraint-Generating Dependencies.
J. Comput. Syst. Sci. 59(1): 94-115 (1999) |
| 1998 |
|---|
| 52 | | Pierre Wolper,
Bernard Boigelot:
Verifying Systems with Infinite but Regular State Spaces.
CAV 1998: 88-97 |
| 51 | EE | Bernard Boigelot,
Stéphane Rassart,
Pierre Wolper:
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract).
ICALP 1998: 152-163 |
| 50 | EE | Pierre Wolper:
Algorithms for Synthesizing Reactive Systems: A Perspective (Abstract).
LOPSTR 1998: 308 |
| 49 | EE | 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) |
| 1997 |
|---|
| 48 | | Ulrich Nitsche,
Pierre Wolper:
Relative Liveness and Behavior Abstraction (Extended Abstract).
PODC 1997: 45-52 |
| 47 | | Bernard Boigelot,
Patrice Godefroid,
Bernard Willems,
Pierre Wolper:
The Power of QDDs (Extended Abstract).
SAS 1997: 172-186 |
| 46 | EE | Alain Finkel,
Bernard Willems,
Pierre Wolper:
A direct symbolic approach to model checking pushdown systems.
Electr. Notes Theor. Comput. Sci. 9: (1997) |
| 45 | EE | Pierre Wolper:
The Meaning of "Formal": From Weak to Strong Formal Methods.
STTT 1(1-2): 6-8 (1997) |
| 1996 |
|---|
| 44 | | Doron Peled,
Thomas Wilke,
Pierre Wolper:
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages.
CONCUR 1996: 596-610 |
| 43 | | Bernard Willems,
Pierre Wolper:
Partial-Order Methods for Model Checking: From Linear Time to Branching Time.
LICS 1996: 294-303 |
| 42 | | Pierre Wolper:
The Meaning of "Formal".
ACM Comput. Surv. 28(4es): 127 (1996) |
| 41 | | Pierre Wolper:
Where is the Algorithmic Support?
ACM Comput. Surv. 28(4es): 58 (1996) |
| 1995 |
|---|
| 40 | | Pierre Wolper:
Computer Aided Verification, 7th International Conference, Liège, Belgium, July, 3-5, 1995, Proceedings
Springer 1995 |
| 39 | EE | Marianne Baudinet,
Jan Chomicki,
Pierre Wolper:
Constraint-Generating Dependencies.
ICDT 1995: 322-337 |
| 38 | | Rob Gerth,
Doron Peled,
Moshe Y. Vardi,
Pierre Wolper:
Simple on-the-fly automatic verification of linear temporal logic.
PSTV 1995: 3-18 |
| 37 | | Pierre Wolper,
Bernard Boigelot:
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract)
SAS 1995: 21-32 |
| 36 | | Froduald Kabanza,
Jean-Marc Stévenne,
Pierre Wolper:
Handling Infinite Temporal Data.
J. Comput. Syst. Sci. 51(1): 3-17 (1995) |
| 1994 |
|---|
| 35 | | Orna Bernholtz,
Moshe Y. Vardi,
Pierre Wolper:
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract).
CAV 1994: 142-155 |
| 34 | | Bernard Boigelot,
Pierre Wolper:
Symbolic Verification with Periodic Sets.
CAV 1994: 55-67 |
| 33 | | Marianne Baudinet,
Jan Chomicki,
Pierre Wolper:
Constraint-Generating Dependencies.
PPCP 1994: 205-217 |
| 32 | | Patrice Godefroid,
Pierre Wolper:
A Partial Approach to Model Checking
Inf. Comput. 110(2): 305-326 (1994) |
| 31 | | Moshe Y. Vardi,
Pierre Wolper:
Reasoning About Infinite Computations
Inf. Comput. 115(1): 1-37 (1994) |
| 1993 |
|---|
| 30 | | 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
North-Holland 1993 |
| 29 | | Pierre Wolper,
Denis Leroy:
Reliable Hashing without Collosion Detection.
CAV 1993: 59-70 |
| 28 | | Pierre Wolper,
Patrice Godefroid:
Partial-Order Methods for Temporal Verification.
CONCUR 1993: 233-246 |
| 27 | | Marianne Baudinet,
Jan Chomicki,
Pierre Wolper:
Temporal Deductive Databases.
Temporal Databases 1993: 294-320 |
| 26 | | 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) |
| 1992 |
|---|
| 25 | | 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 |
|---|
| 24 | | Patrice Godefroid,
Pierre Wolper:
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties.
CAV 1991: 332-342 |
| 23 | | Patrice Godefroid,
Pierre Wolper:
A Partial Approach to Model Checking
LICS 1991: 406-415 |
| 22 | EE | Marianne Baudinet,
Marc Niézette,
Pierre Wolper:
On the Representation of Infinite Temporal Data and Queries.
PODS 1991: 280-290 |
| 1990 |
|---|
| 21 | | Costas Courcoubetis,
Moshe Y. Vardi,
Pierre Wolper,
Mihalis Yannakakis:
Memory Efficient Algorithms for the Verification of Temporal Properties.
CAV 1990: 233-242 |
| 20 | EE | Froduald Kabanza,
Jean-Marc Stévenne,
Pierre Wolper:
Handling Infinite Temporal Data.
PODS 1990: 392-403 |
| 19 | EE | Sudhir Aggarwal,
Costas Courcoubetis,
Pierre Wolper:
Adding Liveness Properties to Coupled Finite-State Machines.
ACM Trans. Program. Lang. Syst. 12(2): 303-339 (1990) |
| 1989 |
|---|
| 18 | | Pierre Wolper,
Vinciane Lovinfosse:
Verifying Properties of Large Sets of Processes with Network Invariants.
Automatic Verification Methods for Finite State Systems 1989: 68-80 |
| 17 | | Martín Abadi,
Leslie Lamport,
Pierre Wolper:
Realizable and Unrealizable Specifications of Reactive Systems.
ICALP 1989: 1-17 |
| 1987 |
|---|
| 16 | | Pierre Wolper:
On the Relation of Programs and Computations to Models of Temporal Logic.
Temporal Logic in Specification 1987: 75-123 |
| 15 | | 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) |
| 1986 |
|---|
| 14 | | Moshe Y. Vardi,
Pierre Wolper:
An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)
LICS 1986: 332-344 |
| 13 | | Pierre Wolper:
Expressing Interesting Properties of Programs in Propositional Temporal Logic.
POPL 1986: 184-193 |
| 12 | | Costas Courcoubetis,
Moshe Y. Vardi,
Pierre Wolper:
Reasoning about Fair Concurrent Programs
STOC 1986: 283-294 |
| 11 | | Moshe Y. Vardi,
Pierre Wolper:
Automata-Theoretic Techniques for Modal Logics of Programs.
J. Comput. Syst. Sci. 32(2): 183-221 (1986) |
| 1985 |
|---|
| 10 | | 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 |
|---|
| 9 | | Shlomit S. Pinter,
Pierre Wolper:
A Temporal Logic for Reasoning about Partially Ordered Computations (Extended Abstract).
PODC 1984: 28-37 |
| 8 | | Moshe Y. Vardi,
Pierre Wolper:
Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract)
STOC 1984: 446-456 |
| 7 | EE | Zohar Manna,
Pierre Wolper:
Synthesis of Communicating Processes from Temporal Logic Specifications.
ACM Trans. Program. Lang. Syst. 6(1): 68-93 (1984) |
| 1983 |
|---|
| 6 | | Pierre Wolper,
Moshe Y. Vardi,
A. Prasad Sistla:
Reasoning about Infinite Computation Paths (Extended Abstract)
FOCS 1983: 185-194 |
| 5 | | Moshe Y. Vardi,
Pierre Wolper:
Yet Another Process Logic (Preliminary Version).
Logic of Programs 1983: 501-512 |
| 4 | | Pierre Wolper:
Temporal Logic Can Be More Expressive
Information and Control 56(1/2): 72-99 (1983) |
| 1982 |
|---|
| 3 | | Pierre Wolper:
Specification and Synthesis of Communicating Processes using an Extended Temporal Logic.
POPL 1982: 20-33 |
| 1981 |
|---|
| 2 | | Pierre Wolper:
Temporal Logic Can Be More Expressive
FOCS 1981: 340-348 |
| 1 | | Zohar Manna,
Pierre Wolper:
Synthesis of Communicating Processes from Temporal Logic Specifications.
Logic of Programs 1981: 253-281 |
