H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 44 Citations 8,901 172 World Ranking 3758 National Ranking 171

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algorithm
  • Algebra

His scientific interests lie mostly in Programming language, Theoretical computer science, Model checking, Predicate abstraction and Liveness. His Programming language research is multidisciplinary, incorporating elements of Constraint programming and Database. His study in the field of Abstraction model checking also crosses realms of Broadcast domain.

His Model checking study integrates concerns from other disciplines, such as Program analysis, Formal verification, Theory of computation and Constraint logic programming. His studies deal with areas such as Abstract interpretation, Mathematical proof, Finite-state machine and Counterexample as well as Predicate abstraction. His study looks at the intersection of Liveness and topics like Termination analysis with Subroutine, Process, Pointer, Source lines of code and Nested loop join.

His most cited work include:

  • ACSAR: software model checking with transfinite refinement (629 citations)
  • A Complete Method for the Synthesis of Linear Ranking Functions (376 citations)
  • Termination proofs for systems code (323 citations)

What are the main themes of his work throughout his whole career to date?

The scientist’s investigation covers issues in Theoretical computer science, Programming language, Model checking, Algorithm and Automaton. His research integrates issues of Mathematical proof, Constraint programming and Counterexample in his study of Theoretical computer science. Programming language is often connected to Constraint logic programming in his work.

His study looks at the relationship between Model checking and fields such as Hybrid system, as well as how they intersect with chemical problems. As part of one scientific family, he deals mainly with the area of Algorithm, narrowing it down to issues related to the Set, and often Discrete mathematics. His studies in Discrete mathematics integrate themes in fields like Nested word, Tree automaton and Automata theory.

He most often published in these fields:

  • Theoretical computer science (37.45%)
  • Programming language (33.71%)
  • Model checking (24.34%)

What were the highlights of his more recent work (between 2014-2021)?

  • Theoretical computer science (37.45%)
  • Programming language (33.71%)
  • Liveness (8.99%)

In recent papers he was focusing on the following fields of study:

His main research concerns Theoretical computer science, Programming language, Liveness, Automaton and Algorithm. His work on Model checking and Abstraction refinement as part of general Theoretical computer science study is frequently connected to TRACE, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. His research investigates the connection between Model checking and topics such as Exploit that intersect with issues in Hybrid system.

Programming language is closely attributed to Counterexample in his study. His Automaton research integrates issues from Scheme and Transfer. His work is dedicated to discovering how Algorithm, Matrix multiplication are connected with Computation and Dynamical system and other disciplines.

Between 2014 and 2021, his most popular works were:

  • Proof Spaces for Unbounded Parallelism (30 citations)
  • Ultimate Automizer and the Search for Perfect Interpolants (27 citations)
  • Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices (25 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algorithm
  • Algebra

His primary scientific interests are in Theoretical computer science, Liveness, Automaton, Programming language and Algorithm. Particularly relevant to Abstraction refinement is his body of work in Theoretical computer science. The various areas that Andreas Podelski examines in his Liveness study include Linear temporal logic, Verification problem, First-order logic and Leverage.

The Automaton study which covers Memory safety that intersects with Software model checker, Counterexample and Program graph. His Correctness study in the realm of Programming language connects with subjects such as Prefix. His Algorithm research incorporates themes from Hyperplane, Matrix multiplication and Linear algebra.

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.

Top Publications

ACSAR: software model checking with transfinite refinement

Mohamed Nassim Seghir;Andreas Podelski.
international spin conference on model checking software (2007)

994 Citations

A Complete Method for the Synthesis of Linear Ranking Functions

Andreas Podelski;Andrey Rybalchenko.
verification model checking and abstract interpretation (2004)

482 Citations

Termination proofs for systems code

Byron Cook;Andreas Podelski;Andrey Rybalchenko.
programming language design and implementation (2006)

454 Citations

Boolean and Cartesian Abstraction for Model Checking C Programs

Thomas Ball;Andreas Podelski;Sriram K. Rajamani.
tools and algorithms for construction and analysis of systems (2001)

435 Citations

Towards a meaning of life

Hassan Aït-Kaci;Andreas Podelski.
Journal of Logic Programming (1993)

383 Citations

Transition invariants

A. Podelski;A. Rybalchenko.
logic in computer science (2004)

349 Citations

Model Checking in CLP

Giorgio Delzanno;Andreas Podelski.
tools and algorithms for construction and analysis of systems (1999)

244 Citations

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

Andreas Podelski;Andrey Rybalchenko.
practical aspects of declarative languages (2007)

201 Citations

A feature constraint system for logic programming with entailment

Hassan Aït-Kaci;Andreas Podelski;Gert Smolka.
Theoretical Computer Science (1994)

179 Citations

TERMINATOR: beyond safety

Byron Cook;Andreas Podelski;Andrey Rybalchenko.
computer aided verification (2006)

163 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Andreas Podelski

Andrey Rybalchenko

Andrey Rybalchenko

Microsoft (United States)

Publications: 44

Viktor Kuncak

Viktor Kuncak

École Polytechnique Fédérale de Lausanne

Publications: 43

Daniel Kroening

Daniel Kroening

Amazon (United States)

Publications: 43

Byron Cook

Byron Cook

Amazon (United States)

Publications: 36

Dirk Beyer

Dirk Beyer

Ludwig-Maximilians-Universität München

Publications: 35

Jürgen Giesl

Jürgen Giesl

RWTH Aachen University

Publications: 31

Krishnendu Chatterjee

Krishnendu Chatterjee

Institute of Science and Technology Austria

Publications: 30

Martin Rinard

Martin Rinard

MIT

Publications: 26

Ahmed Bouajjani

Ahmed Bouajjani

Université Paris Cité

Publications: 26

Rupak Majumdar

Rupak Majumdar

Max Planck Institute for Software Systems

Publications: 25

Sumit Gulwani

Sumit Gulwani

Microsoft (United States)

Publications: 24

Parosh Aziz Abdulla

Parosh Aziz Abdulla

Uppsala University

Publications: 24

Thomas Reps

Thomas Reps

University of Wisconsin–Madison

Publications: 23

Aarti Gupta

Aarti Gupta

Princeton University

Publications: 22

Sriram Sankaranarayanan

Sriram Sankaranarayanan

University of Colorado Boulder

Publications: 22

Something went wrong. Please try again later.