Подписаться
Pierre Wolper
Pierre Wolper
Professor of Computer Science, Université de Liège, Belgium
Подтвержден адрес электронной почты в домене ulg.ac.be - Главная страница
Название
Процитировано
Процитировано
Год
An automata-theoretic approach to automatic program verification
MY Vardi, P Wolper
1st Symposium in Logic in Computer Science (LICS), 1986
24181986
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
12531995
Reasoning about infinite computations
MY Vardi, P Wolper
Information and Computation 115 (1), 1-37, 1994
11971994
Temporal logic can be more expressive
P Wolper
Information and control 56 (1-2), 72-99, 1983
11181983
Memory-efficient algorithms for the verification of temporal properties
C Courcoubetis, M Vardi, P Wolper, M Yannakakis
Formal methods in system design 1, 275-288, 1992
8961992
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
8181984
Automata theoretic techniques for modal logics of programs
MY Vardi, P Wolper
Proceedings of the sixteenth annual acm symposium on theory of computing …, 1984
7461984
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
7052000
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
6351987
Using partial orders for the efficient verification of deadlock freedom and safety properties
P Godefroid, P Wolper
Computer Aided Verification: 3rd International Workshop, CAV'91 Aalborg …, 1992
5521992
Reasoning about infinite computation paths
P Wolper, MY Vardi, AP Sistla
Foundations of Computer Science, 1983., 24th Annual Symposium on, 185-194, 1983
5061983
Realizable and unrealizable specifications of reactive systems
M Abadi, L Lamport, P Wolper
Automata, languages and programming, 1-17, 1989
442*1989
A partial approach to model checking
P Godefroid, P Wolper
Logic in Computer Science, 1991. LICS'91., Proceedings of Sixth Annual IEEE …, 1991
4391991
Expressing interesting properties of programs in propositional temporal logic
P Wolper
Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of …, 1986
4121986
The tableau method for temporal logic: An overview
P Wolper
Logique et Analyse, 119-136, 1985
4081985
Verifying properties of large sets of processes with network invariants
P Wolper, V Lovinfosse
Automatic Verification Methods for Finite State Systems: International …, 1990
3151990
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
3061997
An automata-theoretic approach to branching-time model checking
O Bernholtz, MY Vardi, P Wolper
Computer Aided Verification: 6th International Conference, CAV'94 Stanford …, 1994
2721994
Symbolic verification with periodic sets
B Boigelot, P Wolper
Computer Aided Verification: 6th International Conference, CAV'94 Stanford …, 1994
2311994
Verifying systems with infinite but regular state spaces
B Boigelot, P Wolper
Proc. of CAV’98, LNCS 1427, 1998
230*1998
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20