Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Rybalchenko, Andrey - Institut für Informatik, Technische Universität München
Terminator: Beyond Safety (Tool Paper)
Termination Proofs for Systems Code Microsoft Research
Model Checking Duration Calculus: A Practical Approach
Abstraction Refinement for Termination Byron Cook1
Constraint Solving for Interpolation Andrey Rybalchenko a
I N F O R M A T I K Software Model Checking of
Temporal Verification with Transition Invariants Dissertation
Noname manuscript No. (will be inserted by the editor)
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Heap Assumptions on Demand Andrey Rybalchenko1
Subsumer-First: Steering Symbolic Reachability Andrey Rybalchenko1
Invariant Synthesis for Combined Theories Dirk Beyer1
Approximation and Randomization for Quantitative Information-Flow Analysis
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
DOI 10.1007/s00165-008-0082-7 The Author(s) 2008
A Multi-Modal Framework for Achieving Accountability in Multi-Agent Systems
Constraint Solving for Program Verification: Theory and Practice by Example
Finding heap-bounds for hardware synthesis A. Rybalchenko
Cardinality Abstraction for Declarative Networking Applications
InvGen: An Efficient Invariant Generator Ashutosh Gupta and Andrey Rybalchenko
Heap Assumptions on Demand Andreas Podelski1
Proving Thread Termination Microsoft Research
Constraint Solving for Interpolation Andrey Rybalchenko1,2
Transition Invariants Andreas Podelski Andrey Rybalchenko
Proving program termination In contrast to popular belief, proving termination is not always impossible
