#### Filter Results:

- Full text PDF available (170)

#### Publication Year

1989

2017

- This year (6)
- Last 5 years (59)
- Last 10 years (122)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Andreas Podelski, Andrey Rybalchenko
- VMCAI
- 2004

- Byron Cook, Andreas Podelski, Andrey Rybalchenko
- PLDI
- 2006

Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and context-sensitive program analysis and provides capacity for large program fragments (i.e. more than 20,000 lines of code) together with support for programming language features such… (More)

- Andreas Podelski, Andrey Rybalchenko
- Proceedings of the 19th Annual IEEE Symposium on…
- 2004

Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is a binary relation over program states that contains the transitive closure of the transition relation of the program. A relation is… (More)

- Thomas Ball, Andreas Podelski, Sriram K. Rajamani
- International Journal on Software Tools for…
- 2001

We show how to attack the problem of model checking a C program with recursive procedures using an abstraction that we formally define as the composition of the Boolean and the Cartesian abstractions. It is implemented through a source-to-source transformation into a ‘Boolean’ C program; we give an algorithm to compute the transformation with a cost that is… (More)

- Hassan Aït-Kaci, Andreas Podelski
- J. Log. Program.
- 1991

LIFE is an experimental programming language proposing to integrate three orthogonal programming paradigms proven useful for symbolic computation. From the programmer’s standpoint, it may be perceived as a language taking after logic programming, functional programming, and object-oriented programming. From a formal perspective, it may be seen as an… (More)

- Andreas Podelski, Andrey Rybalchenko
- PADL
- 2007

Software model checking with abstraction refinement is emerging as a practical approach to verify industrial software systems. Its distinguishing characteristics lie in the way it applies logical reasoning to deal with abstraction. It is therefore natural to investigate whether and how the use of a constraint-based programming language may lead to an… (More)

- Byron Cook, Andreas Podelski, Andrey Rybalchenko
- SAS
- 2005

ion Refinement for Termination⋆ Byron Cook, Andreas Podelski, and Andrey Rybalchenko 1 Microsoft Research, Cambridge 2 Max-Planck-Institut für Informatik, Saarbrücken Abstract. Abstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious… (More)

- Rajarshi Ray, Goran Frehse, +4 authors Goran Frehse
- 2012

- Giorgio Delzanno, Andreas Podelski
- International Journal on Software Tools for…
- 2001

We show that constraint logic programming (CLP) can serve as a conceptual basis and as a practical implementation platform for the model checking of infinite-state systems. CLP programs are logical formulas (built up from constraints) that have both a logical interpretation and an operational semantics. Our contributions are: (1) a translation of concurrent… (More)

- Giorgio Delzanno, Andreas Podelski
- TACAS
- 1999

We show that Constraint Logic Programming CLP can serve as a conceptual basis and as a practical implementation platform for the model checking of in nite state systems Our contributions are a semantics preserving translation of concurrent systems into CLP programs a method for verifying safety and liveness properties on the CLP programs produced by the… (More)