Pierre Wolper
Pierre Wolper
Professor of Computer Science, Université de Liège, Belgium
Verified email at ulg.ac.be - Homepage
Title
Cited by
Cited by
Year
An automata-theoretic approach to automatic program verification
MY Vardi, P Wolper
Proceedings of the First Symposium on Logic in Computer Science, 322-331, 1986
20691986
Simple on-the-fly automatic verification of linear temporal logic
R Gerth, D Peled, MY Vardi, P Wolper
International Conference on Protocol Specification, Testing and Verification …, 1995
10461995
Reasoning about infinite computations
MY Vardi, P Wolper
Information and Computation 115 (1), 1-37, 1994
10071994
Temporal logic can be more expressive
P Wolper
Information and control 56 (1-2), 72-99, 1983
9651983
Memory-efficient algorithms for the verification of temporal properties
C Courcoubetis, M Vardi, P Wolper, M Yannakakis
Formal methods in system design 1 (2-3), 275-288, 1992
7891992
Synthesis of communicating processes from temporal logic specifications
Z Manna, P Wolper
ACM Transactions on Programming Languages and Systems (TOPLAS) 6 (1), 68-93, 1984
7401984
Automata-theoretic techniques for modal logics of programs
MY Vardi, P Wolper
Journal of computer and system sciences 32 (2), 183-221, 1986
6551986
An automata-theoretic approach to branching-time model checking
O Kupferman, MY Vardi, P Wolper
Journal of the ACM (JACM) 47 (2), 312-360, 2000
6282000
The complementation problem for Büchi automata with applications to temporal logic
AP Sistla, MY Vardi, P Wolper
Theoretical Computer Science 49 (2-3), 217-237, 1987
5491987
Using partial orders for the efficient verification of deadlock freedom and safety properties
P Godefroid, P Wolper
International Conference on Computer Aided Verification, 332-342, 1991
4941991
Reasoning about infinite computation paths
P Wolper, MY Vardi, AP Sistla
Foundations of Computer Science, 1983., 24th Annual Symposium on, 185-194, 1983
4501983
A partial approach to model checking
P Godefroid, P Wolper
Logic in Computer Science, 1991. LICS'91., Proceedings of Sixth Annual IEEE …, 1991
3811991
Realizable and unrealizable specifications of reactive systems
M Abadi, L Lamport, P Wolper
Automata, languages and programming, 1-17, 1989
380*1989
Expressing interesting properties of programs in propositional temporal logic
P Wolper
Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of …, 1986
3781986
The tableau method for temporal logic: An overview
P Wolper
Logique et Analyse, 119-136, 1985
3481985
Verifying properties of large sets of processes with network invariants
P Wolper, V Lovinfosse
International Conference on Computer Aided Verification, 68-80, 1989
2931989
A direct symbolic approach to model checking pushdown systems
A Finkel, B Willems, P Wolper
Electronic Notes in Theoretical Computer Science 9, 27-37, 1997
2621997
An automata-theoretic approach to branching-time model checking
O Bernholtz, MY Vardi, P Wolper
International Conference on Computer Aided Verification, 142-155, 1994
2591994
Module checking
O Kupferman, MY Vardi, P Wolper
Information and Computation 164 (2), 322-344, 2001
251*2001
Verifying systems with infinite but regular state spaces
B Boigelot, P Wolper
Proc. of CAV’98, LNCS 1427, 1998
214*1998
The system can't perform the operation now. Try again later.
Articles 1–20