2012 - Member of Academia Europaea
2005 - ACM Paris Kanellakis Theory and Practice Award Gerard J. Holzmann, Robert P. Kurshan, Moshe Y. Vardi, Pierre Wolper
His primary areas of investigation include Temporal logic, Theoretical computer science, Automaton, Linear temporal logic and Büchi automaton. His research in Temporal logic tackles topics such as Algebra which are related to areas like Decision problem, Quantum finite automata, Grammar and Regular expression. His work deals with themes such as Algorithm, State and Critical section, which intersect with Theoretical computer science.
His Automaton research is multidisciplinary, incorporating elements of Finite-state machine and Programming language. His specific area of interest is Linear temporal logic, where he studies Interval temporal logic. His research integrates issues of Discrete mathematics, Strongly connected component, Time complexity and Graph in his study of Büchi automaton.
Pierre Wolper spends much of his time researching Theoretical computer science, Temporal logic, Finite-state machine, Algorithm and Automaton. His Theoretical computer science research integrates issues from Computation and State. His work focuses on many connections between Temporal logic and other disciplines, such as Linear temporal logic, that overlap with his field of interest in Multimodal logic and Dynamic logic.
His work in Finite-state machine addresses subjects such as Integer, which are connected to disciplines such as Presburger arithmetic. His Algorithm study combines topics in areas such as Infinite set, Set and Regular language. The study incorporates disciplines such as Discrete mathematics, Linear arithmetic and Algebra in addition to Automaton.
Pierre Wolper mainly focuses on Finite-state machine, Algorithm, Theoretical computer science, Automaton and Set. His Finite-state machine study incorporates themes from Memory model, Correctness and Temporal logic. His Temporal logic study frequently draws parallels with other fields, such as Linear temporal logic.
He studies Theoretical computer science, namely Model checking. His Model checking study integrates concerns from other disciplines, such as State and Büchi automaton. His Automaton research incorporates themes from Discrete mathematics, Integer and Linear arithmetic.
His primary scientific interests are in Finite-state machine, Automaton, Algorithm, Set and Theoretical computer science. His Büchi automaton study in the realm of Finite-state machine interacts with subjects such as Relation. The various areas that he examines in his Büchi automaton study include Model checking, State, Deterministic system and Iterative method.
Pierre Wolper has researched Model checking in several fields, including Closure and Program analysis. His Linear temporal logic and Temporal logic study in the realm of Theoretical computer science connects with subjects such as Upper and lower bounds. His Algebra research is multidisciplinary, relying on both Linear arithmetic and Quantum finite automata.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
An Automata-Theoretic Approach to Automatic Program Verification
Moshe Y Vardi;Pierre Wolper.
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Patrice Godefroid;J. van Leeuwen;J. Hartmanis;G. Goos.
Simple on-the-fly automatic verification of linear temporal logic
Rob Gerth;Doron Peled;Moshe Y. Vardi;Pierre Wolper.
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV (1995)
Reasoning about Infinite Computations
M.Y. Vardi;P. Wolper.
Information & Computation (1994)
Temporal logic can be more expressive
Information & Computation (1983)
Memory Efficient Algorithms for the Verification of Temporal Properties
Costas Courcoubetis;Moshe Y. Vardi;Pierre Wolper;Mihalis Yannakakis.
computer aided verification (1990)
Synthesis of communicating processes from temporal logic specifications
Zohar Manna;Pierre Wolper.
Automata-Theoretic techniques for modal logics of programs
Moshe Y Vardi;Pierre Wolper.
Journal of Computer and System Sciences (1986)
An automata-theoretic approach to branching-time model checking
Orna Kupferman;Moshe Y. Vardi;Pierre Wolper.
Journal of the ACM (2000)
An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)
Moshe Y. Vardi;Pierre Wolper.
logic in computer science (1986)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: