Andreas Podelski
Computational Theory and Mathematics · 2001–2014
A researcher in the Science corpus: 7 papers; trusts 12 researchers and is trusted by 13 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 22 citations into it; #8,434 of 12,182 by trust here, #7,851 by citations
- Software — 19 citations into it; #503 of 1,227 by trust here, #870 by citations
- Artificial Intelligence — 17 citations into it; #14,350 of 35,345 by trust here, #25,040 by citations
- Hardware and Architecture — 5 citations into it
Whom Andreas Podelski trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Thomas Ball
- Sagar Chaki
- Edmund M. Clarke
- Sriram K. Rajamani
- Thomas A. Henzinger
- Bruno Blanchet
- Rupak Majumdar
- Andrey Rybalchenko
- Alex Groce
- Ranjit Jhala
Who trusts Andreas Podelski overall
- Thomas Ball
- Sumit Gulwani
- Siddharth Srivastava
- Byron Cook
- Ranjit Jhala
- Kenneth L. McMillan
- Neil Immerman
- Krishna K. Mehra
- Rupak Majumdar
- Sriram K. Rajamani
Papers from Andreas Podelski's perspective
Ordered by how strongly the researchers Andreas Podelski trusts endorse each paper. Same corpus, a different order for every researcher.
- Lazy abstraction
- The SLAM project: debugging system software via static analysis
- Counterexample-Guided Abstraction Refinement (International Conference on Computer Aided Verification)
- Modular verification of software components in C (25th International Conference on Software Engineering, 2003. Proceedings.)
- INTERPRETATION : ‘A UNIFIED LATTICE MODEL FOR STATIC ANALYSIS OF PROGRAMS BY CONSTRUCTION OR APPROXIMATION
- A static analyzer for large safety-critical software (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
- Bebop: A Symbolic Model Checker for Boolean Programs (SPIN)
- Extended static checking for Java (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
- Automatic predicate abstraction of C programs (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
- Automatically validating temporal safety properties of interfaces (SPIN)
Their papers
- On Verifying Complex Properties using Symbolic Shape Analysis (2006) — 450 citations
- Planning as Model Checking in Hybrid Domains (2014) — 52 citations
- Transition invariants (2004) — 357 citations
- A Complete Method for the Synthesis of Linear Ranking Functions (2004) — 501 citations
- ACSAR: Software Model Checking with Transfinite Refinement (2007) — 631 citations
- Termination proofs for systems code (2006) — 422 citations
- Boolean and Cartesian abstraction for model checking C programs (2001) — 379 citations