- Home
- Best Scientists - Computer Science
- Pierre Wolper

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
50
Citations
18,587
92
World Ranking
3606
National Ranking
41

2012 - Member of Academia Europaea

2005 - ACM Paris Kanellakis Theory and Practice Award Gerard J. Holzmann, Robert P. Kurshan, Moshe Y. Vardi, Pierre Wolper

- Programming language
- Algorithm
- Algebra

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.

- An Automata-Theoretic Approach to Automatic Program Verification (1233 citations)
- Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem (768 citations)
- Reasoning about Infinite Computations (699 citations)

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.

- Theoretical computer science (50.50%)
- Temporal logic (32.67%)
- Finite-state machine (27.72%)

- Finite-state machine (27.72%)
- Algorithm (24.75%)
- Theoretical computer science (50.50%)

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.

- Constructing automata from temporal logic formulas: a tutorial (96 citations)
- Iterating Transducers in the Large (81 citations)
- An effective decision procedure for linear arithmetic over the integers and reals (69 citations)

- Programming language
- Algorithm
- Algebra

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.

**(1986)**

2235 Citations

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.

**(1996)**

1477 Citations

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)**

1170 Citations

Reasoning about Infinite Computations

M.Y. Vardi;P. Wolper.

Information & Computation **(1994)**

1120 Citations

Temporal logic can be more expressive

Pierre Wolper.

Information & Computation **(1983)**

1067 Citations

Memory Efficient Algorithms for the Verification of Temporal Properties

Costas Courcoubetis;Moshe Y. Vardi;Pierre Wolper;Mihalis Yannakakis.

computer aided verification **(1990)**

858 Citations

Synthesis of communicating processes from temporal logic specifications

Zohar Manna;Pierre Wolper.

**(1982)**

791 Citations

Automata-Theoretic techniques for modal logics of programs

Moshe Y Vardi;Pierre Wolper.

Journal of Computer and System Sciences **(1986)**

705 Citations

An automata-theoretic approach to branching-time model checking

Orna Kupferman;Moshe Y. Vardi;Pierre Wolper.

Journal of the ACM **(2000)**

684 Citations

An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)

Moshe Y. Vardi;Pierre Wolper.

logic in computer science **(1986)**

651 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

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:

Rice University

Université Catholique de Louvain

University at Buffalo, State University of New York

Chinese University of Hong Kong, Shenzhen

Microsoft (United States)

Université Paris Cité

Bar-Ilan University

University of Luxembourg

Uppsala University

Weizmann Institute of Science

Dalhousie University

University of Illinois at Urbana-Champaign

Tezpur University

Sapienza University of Rome

University of North Carolina at Chapel Hill

University of Toronto

Monash University

University of Tasmania

Courant Institute of Mathematical Sciences

Brigham and Women's Hospital

University College London

University of Pittsburgh

University of Georgia

Imperial College London

Ben-Gurion University of the Negev

University of New Mexico

Something went wrong. Please try again later.