What is he best known for?
The fields of study he is best known for:
- 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.
His most cited work include:
- 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)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Theoretical computer science (50.50%)
- Temporal logic (32.67%)
- Finite-state machine (27.72%)
What were the highlights of his more recent work (between 2001-2013)?
- Finite-state machine (27.72%)
- Algorithm (24.75%)
- Theoretical computer science (50.50%)
In recent papers he was focusing on the following fields of study:
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.
Between 2001 and 2013, his most popular works were:
- 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)
In his most recent research, the most cited papers focused on:
- 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.
