Travelled to:1 × Canada
1 × France
1 × Germany
1 × Spain
1 × The Netherlands
12 × USA
2 × Greece
2 × United Kingdom
3 × Denmark
3 × Italy
Collaborated with:B.Boigelot M.Y.Vardi ∅ A.Legay P.Godefroid B.Willems F.Cantin C.Courcoubetis A.Linden D.Leroy S.Jodogne S.Rassart O.Bernholtz M.Baudinet M.Niézette F.Kabanza J.Stévenne M.Abadi L.Lamport A.P.Sistla M.Yannakakis
Talks about:automata (11) tempor (6) arithmet (5) approach (5) verif (5) theoret (4) program (4) system (4) model (4) logic (4)
Person: Pierre Wolper
DBLP: Wolper:Pierre
Facilitated 1 volumes:
EdContributed to:
2013
2008200920042003
2002
200120001998
1998
1998
1997
199619951994199319911991
19911990199019891986
1986
1986198519841982Wrote 29 papers:
- TACAS-2013-LindenW #approach #memory management
- A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems (AL, PW), pp. 339–353.
- CIAA-2008-CantinLW #automaton
- Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 112–121.
- CIAA-J-2008-CantinLW09 #automaton
- Computing Convex Hulls by Automata Iteration (FC, AL, PW), pp. 647–667.
- TACAS-2004-BoigelotLW #model checking
- ω-Regular Model Checking (BB, AL, PW), pp. 561–575.
- CAV-2003-BoigelotLW #in the large #transducer
- Iterating Transducers in the Large (BB, AL, PW), pp. 223–235.
- ICLP-2002-BoigelotW #automaton #constraints #finite #overview #perspective #representation
- Representing Arithmetic Constraints with Finite Automata: An Overview (BB, PW), pp. 1–19.
- IJCAR-2001-BoigelotJW #automaton #integer #linear #on the #using
- On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables (BB, SJ, PW), pp. 611–625.
- TACAS-2000-WolperB #automaton #constraints #linear #on the
- On the Construction of Automata from Linear Arithmetic Constraints (PW, BB), pp. 1–19.
- CAV-1998-WolperB #infinity #verification
- Verifying Systems with Infinite but Regular State Spaces (PW, BB), pp. 88–97.
- ICALP-1998-BoigelotRW #automaton #integer #on the
- On the Expressiveness of Real and Integer Arithmetic Automata (BB, SR, PW), pp. 152–163.
- LOPSTR-1998-Wolper #algorithm #perspective
- Algorithms for Synthesizing Reactive Systems: A Perspective (PW), p. 308.
- SAS-1997-BoigelotGWW #power of
- The Power of QDDs (BB, PG, BW, PW), pp. 172–186.
- LICS-1996-WillemsW #branch #linear #model checking #partial order
- Partial-Order Methods for Model Checking: From Linear Time to Branching Time (BW, PW), pp. 294–303.
- SAS-1995-WolperB #approach #constraints
- An Automata-Theoretic Approach to Presburger Arithmetic Constraints (PW, BB), pp. 21–32.
- CAV-1994-BernholtzVW #approach #model checking
- An Automata-Theoretic Approach to Branching-Time Model Checking (OB, MYV, PW), pp. 142–155.
- CAV-1994-BoigelotW #set #verification
- Symbolic Verification with Periodic Sets (BB, PW), pp. 55–67.
- CAV-1993-WolperL #detection #reliability
- Reliable Hashing without Collosion Detection (PW, DL), pp. 59–70.
- CAV-1991-GodefroidW #concurrent #partial order #performance #safety #using #verification
- Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties (PG, PW), pp. 332–342.
- LICS-1991-GodefroidW #approach #model checking
- A Partial Approach to Model Checking (PG, PW), pp. 406–415.
- PODS-1991-BaudinetNW #infinity #on the #query #representation
- On the Representation of Infinite Temporal Data and Queries (MB, MN, PW), pp. 280–290.
- CAV-1990-CourcoubetisVWY #algorithm #memory management #performance #verification
- Memory Efficient Algorithms for the Verification of Temporal Properties (CC, MYV, PW, MY), pp. 233–242.
- PODS-1990-KabanzaSW #infinity
- Handling Infinite Temporal Data (FK, JMS, PW), pp. 392–403.
- ICALP-1989-AbadiLW #specification
- Realizable and Unrealizable Specifications of Reactive Systems (MA, LL, PW), pp. 1–17.
- LICS-1986-VardiW #approach #automation #verification
- An Automata-Theoretic Approach to Automatic Program Verification (MYV, PW), pp. 332–344.
- POPL-1986-Wolper #logic #source code
- Expressing Interesting Properties of Programs in Propositional Temporal Logic (PW), pp. 184–193.
- STOC-1986-CourcoubetisVW #concurrent #reasoning #source code
- Reasoning about Fair Concurrent Programs (CC, MYV, PW), pp. 283–294.
- ICALP-1985-SistlaVW #automaton #logic #problem
- The Complementation Problem for Büchi Automata with Applications to Temporal Logic (APS, MYV, PW), pp. 465–474.
- STOC-1984-VardiW #automaton #logic #source code
- Automata Theoretic Techniques for Modal Logics of Programs (MYV, PW), pp. 446–456.
- POPL-1982-Wolper #communication #logic #process #specification #synthesis #using
- Specification and Synthesis of Communicating Processes using an Extended Temporal Logic (PW), pp. 20–33.