World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
52
Citations
19347
World Ranking
4956
National Ranking
52

Research.com Recognitions

  • 2012 - Member of Academia Europaea
  • 2005 - ACM Paris Kanellakis Theory and Practice Award Gerard J. Holzmann, Robert P. Kurshan, Moshe Y. Vardi, Pierre Wolper

Overview

Pierre Wolper is affiliated with the University of Liège in Belgium. Their academic career includes collaboration with several frequent co-authors, notably Kim G. Larsen, Natarajan Shankar, and Somesh Jha.

The recent publication record of Pierre Wolper includes the paper titled 2018 CAV award, published in 2021 in the journal Formal Methods in System Design. This paper involved collaboration with Kim G. Larsen and was focused on work relevant to formal methods and system verification.

Frequent publication venues associated with Pierre Wolper consist of:

  • Formal Methods in System Design

Their work has resulted in several awards, including:

  • Member of Academia Europaea (2012)
  • ACM Paris Kanellakis Theory and Practice Award (2005), awarded jointly with Gerard J. Holzmann, Robert P. Kurshan, and Moshe Y. Vardi

Best Publications

  • 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

  • Temporal logic can be more expressive

    Pierre Wolper

  • Simple on-the-fly automatic verification of linear temporal logic

    Rob Gerth;Doron Peled;Moshe Y. Vardi;Pierre Wolper

  • Reasoning about Infinite Computations

    M.Y. Vardi;P. Wolper

  • Memory Efficient Algorithms for the Verification of Temporal Properties

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

  • 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

  • An automata-theoretic approach to branching-time model checking

    Orna Kupferman;Moshe Y. Vardi;Pierre Wolper

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

    Moshe Y. Vardi;Pierre Wolper

  • The complementation problem for Bu¨chi automata with applications to temporal logic

    A. Prasad Sistla;M. Y. Vardi;P. Wolper

  • Reasoning about infinite computation paths

    Pierre Wolper;Moshe Y. Vardi;A. Prasad Sistla

  • Using partial orders for the efficient verification of deadlock freedom and safety properties

    Patrice Godefroid;Pierre Wolper

  • A partial approach to model checking

    P. Godefroid;P. Wolper

  • Expressing interesting properties of programs in propositional temporal logic

    Pierre Wolper

  • The tableau method for temporal logic: An overview

    Pierre Wolper

  • Realizable and Unrealizable Specifications of Reactive Systems

    Martín Abadi;Leslie Lamport;Pierre Wolper

  • Verifying Properties of Large Sets of Processes with Network Invariants

    Pierre Wolper;Vinciane Lovinfosse

  • A direct symbolic approach to model checking pushdown systems.

    Alain Finkel;Bernard Willems;Pierre Wolper

  • Symbolic Verification with Periodic Sets

    Bernard Boigelot;Pierre Wolper

  • Automata theoretic techniques for modal logics of programs: (Extended abstract)

    Moshe Y. Vardi;Pierre Wolper

Frequent Co-Authors

Moshe Y. Vardi
Moshe Y. Vardi Rice University
Axel Legay
Axel Legay Université Catholique de Louvain
Jan Chomicki
Jan Chomicki University at Buffalo, State University of New York
Costas Courcoubetis
Costas Courcoubetis Chinese University of Hong Kong, Shenzhen
Patrice Godefroid
Patrice Godefroid Microsoft (United States)
A. Prasad Sistla
A. Prasad Sistla University of Illinois at Chicago
Ahmed Bouajjani
Ahmed Bouajjani Université Paris Cité
Amir Pnueli
Amir Pnueli Weizmann Institute of Science
Zohar Manna
Zohar Manna Stanford University
Doron Peled
Doron Peled Bar-Ilan University

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

Report an issue

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:

Related Online Degrees & Career Pathways

Choosing to study Computer Science in the USA opens up a wide range of online options tailored to diverse student needs. For those with academic challenges, some universities are known as a college with low gpa acceptance, helping students start their tech careers even if their grades aren’t perfect.

If you want to accelerate your education, consider an accelerated cs degree program, which lets you earn your credentials in less time and enter the workforce faster.

Computer Science skills are also transferable to related fields. For example, those interested in sustainability can use their background to explore options like environmental engineering; you’ll find some of the cheapest online environmental science degree programs available to broaden your skill set affordably.

Unsure what path is right for you? Discover the career versatility by learning what can you get with an environmental science degree. Computer Science pairs perfectly with many growing fields, offering flexible career pathways for the future.

Best Scientists Citing Pierre Wolper

Trending Scientists

Recently Published Articles