The SCEAS System
| |||||||

## Search the dblp DataBase
Andrey Rybalchenko:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Byron Cook, Andreas Podelski, Andrey Rybalchenko
**Terminator: Beyond Safety.**[Citation Graph (0, 0)][DBLP] CAV, 2006, pp:415-418 [Conf] - Alexander Malkis, Andreas Podelski, Andrey Rybalchenko
**Thread-Modular Verification Is Cartesian Abstract Interpretation.**[Citation Graph (0, 0)][DBLP] ICTAC, 2006, pp:183-197 [Conf] - Roland Meyer, Johannes Faber, Andrey Rybalchenko
**Model Checking Duration Calculus: A Practical Approach.**[Citation Graph (0, 0)][DBLP] ICTAC, 2006, pp:332-346 [Conf] - Andreas Podelski, Andrey Rybalchenko
**Transition Invariants.**[Citation Graph (0, 0)][DBLP] LICS, 2004, pp:32-41 [Conf] - Andreas Podelski, Andrey Rybalchenko
**ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement.**[Citation Graph (0, 0)][DBLP] PADL, 2007, pp:245-259 [Conf] - Byron Cook, Andreas Podelski, Andrey Rybalchenko
**Termination proofs for systems code.**[Citation Graph (0, 0)][DBLP] PLDI, 2006, pp:415-426 [Conf] - Andreas Podelski, Andrey Rybalchenko
**Transition predicate abstraction and fair termination.**[Citation Graph (0, 0)][DBLP] POPL, 2005, pp:132-144 [Conf] - Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, Moshe Y. Vardi
**Proving that programs eventually do something good.**[Citation Graph (0, 0)][DBLP] POPL, 2007, pp:265-276 [Conf] - Byron Cook, Andreas Podelski, Andrey Rybalchenko
**Abstraction Refinement for Termination.**[Citation Graph (0, 0)][DBLP] SAS, 2005, pp:87-101 [Conf] - Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
**Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems.**[Citation Graph (0, 0)][DBLP] TACAS, 2005, pp:124-139 [Conf] - Andreas Podelski, Andrey Rybalchenko
**A Complete Method for the Synthesis of Linear Ranking Functions.**[Citation Graph (0, 0)][DBLP] VMCAI, 2004, pp:239-251 [Conf] - Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko
**Path invariants.**[Citation Graph (0, 0)][DBLP] PLDI, 2007, pp:300-309 [Conf] - Byron Cook, Andreas Podelski, Andrey Rybalchenko
**Proving thread termination.**[Citation Graph (0, 0)][DBLP] PLDI, 2007, pp:320-330 [Conf] - Alexander Malkis, Andreas Podelski, Andrey Rybalchenko
**Precise Thread-Modular Verification.**[Citation Graph (0, 0)][DBLP] SAS, 2007, pp:218-232 [Conf] - Jörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski
**Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL.**[Citation Graph (0, 0)][DBLP] MoChArt, 2006, pp:51-66 [Conf] - Andreas Podelski, Andrey Rybalchenko
**Transition predicate abstraction and fair termination.**[Citation Graph (0, 0)][DBLP] ACM Trans. Program. Lang. Syst., 2007, v:29, n:3, pp:- [Journal] **Non-monotonic Refinement of Control Abstraction for Concurrent Programs.**[Citation Graph (, )][DBLP]**Heap Assumptions on Demand.**[Citation Graph (, )][DBLP]**Proving Conditional Termination.**[Citation Graph (, )][DBLP]**Cardinality Abstraction for Declarative Networking Applications.**[Citation Graph (, )][DBLP]**InvGen: An Efficient Invariant Generator.**[Citation Graph (, )][DBLP]**Constraint Solving for Program Verification: Theory and Practice by Example.**[Citation Graph (, )][DBLP]**Approximation and Randomization for Quantitative Information-Flow Analysis.**[Citation Graph (, )][DBLP]**Constraint Solving for Program Verification: Theory and Practice by Example.**[Citation Graph (, )][DBLP]**Finding heap-bounds for hardware synthesis.**[Citation Graph (, )][DBLP]**Operational Semantics for Declarative Networking.**[Citation Graph (, )][DBLP]**Verifying liveness for asynchronous programs.**[Citation Graph (, )][DBLP]**Proving non-termination.**[Citation Graph (, )][DBLP]**Thread-Modular Counterexample-Guided Abstraction Refinement.**[Citation Graph (, )][DBLP]**Automatic Discovery and Quantification of Information Leaks.**[Citation Graph (, )][DBLP]**Subsumer-First: Steering Symbolic Reachability Analysis.**[Citation Graph (, )][DBLP]**From Tests to Proofs.**[Citation Graph (, )][DBLP]**Invariant Synthesis for Combined Theories.**[Citation Graph (, )][DBLP]**Constraint Solving for Interpolation.**[Citation Graph (, )][DBLP]**Refinement type inference via abstract interpretation**[Citation Graph (, )][DBLP]**Applying Prolog to Develop Distributed Systems**[Citation Graph (, )][DBLP]
Search in 0.225secs, Finished in 0.227secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |