| |
 |      |
                                            |
Note: Links lead to the DBLP on the Web. Pierre Wolper 57 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 56 Pierre Wolper: Representing Periodic Temporal Information with Automata. TIME 2001 : 179 55 Orna Kupferman , Moshe Y. Vardi , Pierre Wolper: Module Checking. Information and Computation 164 (2): 322-344 (2001) 54 Pierre Wolper: Linear Repeating Points. Constraint Databases 2000 : 305-314 53 Pierre Wolper: Constructing Automata from Temporal Logic Formulas: A Tutorial. European Educational Forum: School on Formal Methods and Performance Analysis 2000 : 261-277 52 Pierre Wolper, Bernard Boigelot : On the Construction of Automata from Linear Arithmetic Constraints. TACAS 2000 : 1-19 51 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. Information Processing Letters 74 (5-6): 221-227 (2000) 50 Orna Kupferman , Moshe Y. Vardi , Pierre Wolper: An automata-theoretic approach to branching-time model checking. JACM 47 (2): 312-360 (2000) 49 Marianne Baudinet , Jan Chomicki , Pierre Wolper: Constraint-Generating Dependencies. JCSS 59 (1): 94-115 (1999) 48 Pierre Wolper, Bernard Boigelot : Verifying Systems with Infinite but Regular State Spaces. CAV 1998 : 88-97 47 Bernard Boigelot , Stéphane Rassart , Pierre Wolper: On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract). ICALP 1998 : 152-163 46 Pierre Wolper: Algorithms for Synthesizing Reactive Systems: A Perspective (Abstract). LOPSTR 1998 : 308 45 Doron Peled , Thomas Wilke , Pierre Wolper: An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages. TCS 195 (2): 183-203 (1998) 44 Ulrich Nitsche , Pierre Wolper: Relative Liveness and Behavior Abstraction (Extended Abstract). PODC 1997 : 45-52 43 Bernard Boigelot , Patrice Godefroid , Bernard Willems , Pierre Wolper: The Power of QDDs (Extended Abstract). SAS 1997 : 172-186 42 Pierre Wolper: The Meaning of "Formal": From Weak to Strong Formal Methods. STTT 1 (1-2): 6-8 (1997) 41 Doron Peled , Thomas Wilke , Pierre Wolper: An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. CONCUR 1996 : 596-610 40 Bernard Willems , Pierre Wolper: Partial-Order Methods for Model Checking: From Linear Time to Branching Time. LICS 1996 : 294-303 39 Pierre Wolper: The Meaning of "Formal". ACM Computing Surveys 28 (4es): 127 (1996) 38 Pierre Wolper: Where is the Algorithmic Support? ACM Computing Surveys 28 (4es): 58 (1996) 37 Marianne Baudinet , Jan Chomicki , Pierre Wolper: Constraint-Generating Dependencies. ICDT 1995 : 322-337 36 Rob Gerth , Doron Peled , Moshe Y. Vardi , Pierre Wolper: Simple on-the-fly automatic verification of linear temporal logic. PSTV 1995 : 3-18 35 Pierre Wolper, Bernard Boigelot : An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract). SAS 1995 : 21-32 34 F. Kabanza , J.-M. Stevenne , Pierre Wolper: Handling Infinite Temporal Data. JCSS 51 (1): 3-17 (1995) 33 Orna Bernholtz , Moshe Y. Vardi , Pierre Wolper: An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract). CAV 1994 : 142-155 32 Bernard Boigelot , Pierre Wolper: Symbolic Verification with Periodic Sets. CAV 1994 : 55-67 31 Marianne Baudinet , Jan Chomicki , Pierre Wolper: Constraint-Generating Dependencies. PPCP 1994 : 205-217 30 Patrice Godefroid , Pierre Wolper: A Partial Approach to Model Checking. Information and Computation 110 (2): 305-326 (1994) 29 Moshe Y. Vardi , Pierre Wolper: Reasoning About Infinite Computations. Information and Computation 115 (1): 1-37 (1994) 28 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 27 Pierre Wolper, Denis Leroy : Reliable Hashing without Collosion Detection. CAV 1993 : 59-70 26 Pierre Wolper, Patrice Godefroid : Partial-Order Methods for Temporal Verification. CONCUR 1993 : 233-246 25 Marianne Baudinet , Jan Chomicki , Pierre Wolper: Temporal Deductive Databases. Temporal Databases 1993 : 294-320 24 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) 23 Constantin 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) 22 Patrice Godefroid , Pierre Wolper: Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties. CAV 1991 : 332-342 21 Patrice Godefroid , Pierre Wolper: A Partial Approach to Model Checking. LICS 1991 : 406-415 20 Marianne Baudinet , Marc Niézette , Pierre Wolper: On the Representation of Infinite Temporal Data and Queries. PODS 1991 : 280-290 19 Costas Courcoubetis , Moshe Y. Vardi , Pierre Wolper, Mihalis Yannakakis : Memory Efficient Algorithms for the Verification of Temporal Properties. CAV 1990 : 233-242 18 F. Kabanza , J.-M. Stevenne , Pierre Wolper: Handling Infinite Temporal Data. PODS 1990 : 392-403 17 S. Aggarwal , Costas Courcoubetis , Pierre Wolper: Adding Liveness Properties to Coupled Finite-State Machines. TOPLAS 12 (2): 303-339 (1990) 16 Pierre Wolper, Vinciane Lovinfosse : Verifying Properties of Large Sets of Processes with Network Invariants. Automatic Verification Methods for Finite State Systems 1989 : 68-80 15 Martín Abadi , Leslie Lamport , Pierre Wolper: Realizable and Unrealizable Specifications of Reactive Systems. ICALP 1989 : 1-17 14 Pierre Wolper: On the Relation of Programs and Computations to Models of Temporal Logic. Temporal Logic in Specification 1987 : 75-123 13 A. Prasad Sistla , Moshe Y. Vardi , Pierre Wolper: The Complementation Problem for Büchi Automata with Appplications to Temporal Logic. TCS 49 : 217-237 (1987) 12 Moshe Y. Vardi , Pierre Wolper: An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report). LICS 1986 : 332-344 11 Pierre Wolper: Expressing Interesting Properties of Programs in Propositional Temporal Logic. POPL 1986 : 184-193 10 Constantin Courcoubetis , Moshe Y. Vardi , Pierre Wolper: Reasoning about Fair Concurrent Programs. STOC 1986 : 283-294 9 Moshe Y. Vardi , Pierre Wolper: Automata-Theoretic Techniques for Modal Logics of Programs. JCSS 32 (2): 183-221 (1986) 8 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 7 Shlomit S. Pinter , Pierre Wolper: A Temporal Logic for Reasoning about Partially Ordered Computations (Extended Abstract). PODC 1984 : 28-37 6 Moshe Y. Vardi , Pierre Wolper: Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract). STOC 1984 : 446-456 5 Zohar Manna , Pierre Wolper: Synthesis of Communicating Processes from Temporal Logic Specifications. TOPLAS 6 (1): 68-93 (1984) 4 Pierre Wolper, Moshe Y. Vardi , A. Prasad Sistla : Reasoning about Infinite Computation Paths (Extended Abstract). FOCS 1983 : 185-194 3 Pierre Wolper: Temporal Logic Can Be More Expressive. Information and Control 56 (1/2): 72-99 (1983) 2 Pierre Wolper: Specification and Synthesis of Communicating Processes using an Extended Temporal Logic. POPL 1982 : 20-33 1 Pierre Wolper: Temporal Logic Can Be More Expressive. FOCS 1981 : 340-348  DiSC'02 © 2003 Association for Computing Machinery |
