The following pages link to Pierre Wolper (Q930284):
Displaying 36 items.
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- A partial approach to model checking (Q1327383) (← links)
- Reasoning about infinite computations (Q1341752) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- Constraint-generating dependencies (Q1807678) (← links)
- Module checking (Q1854407) (← links)
- Handling infinite temporal data (Q1900914) (← links)
- (Q2851067) (← links)
- On (Omega-)regular model checking (Q2946619) (← links)
- (Q3211248) (← links)
- Temporal logic can be more expressive (Q3317085) (← links)
- (Q3341881) (← links)
- COMPUTING CONVEX HULLS BY AUTOMATA ITERATION (Q3395136) (← links)
- Computing Convex Hulls by Automata Iteration (Q3602806) (← links)
- Synthesis of Communicating Processes from Temporal Logic Specifications (Q3673090) (← links)
- (Q3710510) (← links)
- (Q3948585) (← links)
- (Q4023541) (← links)
- (Q4037099) (← links)
- (Q4037388) (← links)
- (Q4219027) (← links)
- (Q4223067) (← links)
- (Q4431336) (← links)
- (Q4508946) (← links)
- (Q4518891) (← links)
- (Q4539644) (← links)
- (Q4547769) (← links)
- (Q4809151) (← links)
- An effective decision procedure for linear arithmetic over the integers and reals (Q5277733) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5308434) (← links)
- A Verification-Based Approach to Memory Fence Insertion in PSO Memory Systems (Q5326335) (← links)
- Relative liveness and behavior abstraction (extended abstract) (Q5361465) (← links)
- An automata-theoretic approach to branching-time model checking (Q5385339) (← links)
- Computer Aided Verification (Q5900680) (← links)
