2009 |
25 | EE | Juan A. Navarro,
Andrey Rybalchenko:
Operational Semantics for Declarative Networking.
PADL 2009: 76-90 |
24 | EE | Pierre Ganty,
Rupak Majumdar,
Andrey Rybalchenko:
Verifying liveness for asynchronous programs.
POPL 2009: 102-113 |
23 | EE | Ashutosh Gupta,
Rupak Majumdar,
Andrey Rybalchenko:
From Tests to Proofs.
TACAS 2009: 262-276 |
2008 |
22 | EE | Andreas Podelski,
Andrey Rybalchenko,
Thomas Wies:
Heap Assumptions on Demand.
CAV 2008: 314-327 |
21 | EE | Byron Cook,
Sumit Gulwani,
Tal Lev-Ami,
Andrey Rybalchenko,
Mooly Sagiv:
Proving Conditional Termination.
CAV 2008: 328-340 |
20 | EE | Ashutosh Gupta,
Thomas A. Henzinger,
Rupak Majumdar,
Andrey Rybalchenko,
Ru-Gang Xu:
Proving non-termination.
POPL 2008: 147-158 |
19 | EE | Roland Meyer,
Johannes Faber,
Jochen Hoenicke,
Andrey Rybalchenko:
Model checking Duration Calculus: a practical approach.
Formal Asp. Comput. 20(4-5): 481-505 (2008) |
2007 |
18 | EE | Andreas Podelski,
Andrey Rybalchenko:
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement.
PADL 2007: 245-259 |
17 | EE | Dirk Beyer,
Thomas A. Henzinger,
Rupak Majumdar,
Andrey Rybalchenko:
Path invariants.
PLDI 2007: 300-309 |
16 | EE | Byron Cook,
Andreas Podelski,
Andrey Rybalchenko:
Proving thread termination.
PLDI 2007: 320-330 |
15 | EE | Byron Cook,
Alexey Gotsman,
Andreas Podelski,
Andrey Rybalchenko,
Moshe Y. Vardi:
Proving that programs eventually do something good.
POPL 2007: 265-276 |
14 | EE | Alexander Malkis,
Andreas Podelski,
Andrey Rybalchenko:
Precise Thread-Modular Verification.
SAS 2007: 218-232 |
13 | EE | Andrey Rybalchenko,
Viorica Sofronie-Stokkermans:
Constraint Solving for Interpolation.
VMCAI 2007: 346-362 |
12 | EE | Dirk Beyer,
Thomas A. Henzinger,
Rupak Majumdar,
Andrey Rybalchenko:
Invariant Synthesis for Combined Theories.
VMCAI 2007: 378-394 |
11 | EE | Andreas Podelski,
Andrey Rybalchenko:
Transition predicate abstraction and fair termination.
ACM Trans. Program. Lang. Syst. 29(3): (2007) |
2006 |
10 | EE | Byron Cook,
Andreas Podelski,
Andrey Rybalchenko:
Terminator: Beyond Safety.
CAV 2006: 415-418 |
9 | EE | Alexander Malkis,
Andreas Podelski,
Andrey Rybalchenko:
Thread-Modular Verification Is Cartesian Abstract Interpretation.
ICTAC 2006: 183-197 |
8 | EE | Roland Meyer,
Johannes Faber,
Andrey Rybalchenko:
Model Checking Duration Calculus: A Practical Approach.
ICTAC 2006: 332-346 |
7 | EE | Jörg Hoffmann,
Jan-Georg Smaus,
Andrey Rybalchenko,
Sebastian Kupferschmid,
Andreas Podelski:
Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL.
MoChArt 2006: 51-66 |
6 | EE | Byron Cook,
Andreas Podelski,
Andrey Rybalchenko:
Termination proofs for systems code.
PLDI 2006: 415-426 |
2005 |
5 | EE | Andreas Podelski,
Andrey Rybalchenko:
Transition predicate abstraction and fair termination.
POPL 2005: 132-144 |
4 | EE | Byron Cook,
Andreas Podelski,
Andrey Rybalchenko:
Abstraction Refinement for Termination.
SAS 2005: 87-101 |
3 | EE | Amir Pnueli,
Andreas Podelski,
Andrey Rybalchenko:
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems.
TACAS 2005: 124-139 |
2004 |
2 | EE | Andreas Podelski,
Andrey Rybalchenko:
Transition Invariants.
LICS 2004: 32-41 |
1 | EE | Andreas Podelski,
Andrey Rybalchenko:
A Complete Method for the Synthesis of Linear Ranking Functions.
VMCAI 2004: 239-251 |