World's Best Scientists 2026 revealed!
Andreas Podelski

Andreas Podelski

D-Index & Metrics

Computer Science

D-Index
53
Citations
10273
World Ranking
4865
National Ranking
217

Overview

Andreas Podelski is affiliated with the University of Freiburg in Germany. Their research primarily spans the field of Computer Science, with a focus on several subfields including Computational Theory and Mathematics, Artificial Intelligence, Software, Hardware and Architecture, and Computer Networks and Communications.

The scientist has contributed extensively to topics such as Formal Methods in Verification, Logic, Programming, and Type Systems, Software Testing and Debugging Techniques, Advanced Software Engineering Methodologies, Security and Verification in Computing, Software Engineering Research, and Model-Driven Software Engineering Techniques.

Recent publications by Andreas Podelski include the following papers:

  • Stratified Commutativity in Verification Algorithms for Concurrent Programs, 2023, Proceedings of the ACM on Programming Languages
  • Commutativity Simplifies Proofs of Parameterized Programs, 2024, Proceedings of the ACM on Programming Languages
  • Temporal Planning as Refinement-Based Model Checking, 2021, Proceedings of the International Conference on Automated Planning and Scheduling
  • Systematic Adaptation and Investigation of the Understandability of a Formal Pattern Language, 2024, Requirements Engineering
  • Decomposing Reach Set Computations with Low-Dimensional Sets and High-Dimensional Matrices (Extended Version), 2022, Information and Computation

Frequent coauthors who have collaborated with Andreas Podelski include:

  • Dominik Klumpp
  • Daniel Dietsch
  • Matthias Heizmann
  • Azadeh Farzan
  • Frank Schüssele

Their most common publication venues encompass:

  • Proceedings of the ACM on Programming Languages
  • Requirements Engineering
  • Zenodo (CERN European Organization for Nuclear Research)
  • arXiv (Cornell University)
  • Proceedings of the International Conference on Automated Planning and Scheduling

Best Publications

  • ACSAR: software model checking with transfinite refinement

    Mohamed Nassim Seghir;Andreas Podelski

  • A Complete Method for the Synthesis of Linear Ranking Functions

    Andreas Podelski;Andrey Rybalchenko

  • Towards a meaning of life

    Hassan Aït-Kaci;Andreas Podelski

  • Termination proofs for systems code

    Byron Cook;Andreas Podelski;Andrey Rybalchenko

  • Boolean and Cartesian Abstraction for Model Checking C Programs

    Thomas Ball;Andreas Podelski;Sriram K. Rajamani

  • Transition invariants

    A. Podelski;A. Rybalchenko

  • Model Checking in CLP

    Giorgio Delzanno;Andreas Podelski

  • ARMC: the logical choice for software model checking with abstraction refinement

    Andreas Podelski;Andrey Rybalchenko

  • Software Model Checking for People Who Love Automata

    Matthias Heizmann;Jochen Hoenicke;Andreas Podelski

  • TERMINATOR: beyond safety

    Byron Cook;Andreas Podelski;Andrey Rybalchenko

  • A feature constraint system for logic programming with entailment

    Hassan Aït-Kaci;Andreas Podelski;Gert Smolka

  • Proving program termination

    Byron Cook;Andreas Podelski;Andrey Rybalchenko

  • Abstraction refinement for termination

    Byron Cook;Andreas Podelski;Andrey Rybalchenko

  • Transition predicate abstraction and fair termination

    Andreas Podelski;Andrey Rybalchenko

  • Proving that programs eventually do something good

    Byron Cook;Alexey Gotsman;Andreas Podelski;Andrey Rybalchenko

  • Boolean and Cartesian abstraction for model checking C programs

    Thomas Ball;Andreas Podelski;Sriram K. Rajamani

  • Nested interpolants

    Matthias Heizmann;Jochen Hoenicke;Andreas Podelski

  • Transition predicate abstraction and fair termination

    Andreas Podelski;Andrey Rybalchenko;Jens Palsberg;Martín Abadi

  • Refinement of Trace Abstraction

    Matthias Heizmann;Jochen Hoenicke;Andreas Podelski

  • Verification of cryptographic protocols: tagging enforces termination

    Bruno Blanchet;Andreas Podelski

  • Efficient algorithms for pre* and post* on interprocedural parallel flow graphs

    Javier Esparza;Andreas Podelski

Frequent Co-Authors

Andrey Rybalchenko
Andrey Rybalchenko Microsoft (United States)
Byron Cook
Byron Cook Amazon (United States)
Bernd Finkbeiner
Bernd Finkbeiner Saarland University
Michael Leuschel
Michael Leuschel Heinrich Heine University Düsseldorf
Radu Grosu
Radu Grosu TU Wien
Javier Esparza
Javier Esparza Technical University of Munich
Thomas Ball
Thomas Ball Microsoft (United States)
Sriram K. Rajamani
Sriram K. Rajamani Microsoft (United States)
Mooly Sagiv
Mooly Sagiv Tel Aviv University
Kurt Jensen
Kurt Jensen Aarhus 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

Thinking beyond traditional classrooms, many students are now exploring online education for flexible and affordable learning. For those seeking cost-effective options, there are cheap online college classes that make a computer science or related degree more accessible. These programs lower barriers to entry while maintaining quality standards.

Not all students follow a traditional academic route. Fortunately, online schools that accept low gpa help open doors for learners who may not have top grades but are motivated to pursue computer science careers. These schools offer supportive pathways for adult learners and career-changers alike.

Completing a degree online offers the flexibility to explore complementary fields. For example, those with an interest in the environment might consider options similar to jobs for environmental science majors, combining tech skills with environmental impact.

If you’re eager to accelerate your journey, some universities offer a 2-year computer science degree online. These accelerated programs can fast-track your entry into high-demand tech careers, combining speed and flexibility for driven individuals.

Best Scientists Citing Andreas Podelski

Trending Scientists