The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrey Rybalchenko: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Byron Cook, Andreas Podelski, Andrey Rybalchenko
    Terminator: Beyond Safety. [Citation Graph (0, 0)][DBLP]
    CAV, 2006, pp:415-418 [Conf]
  2. Alexander Malkis, Andreas Podelski, Andrey Rybalchenko
    Thread-Modular Verification Is Cartesian Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2006, pp:183-197 [Conf]
  3. Roland Meyer, Johannes Faber, Andrey Rybalchenko
    Model Checking Duration Calculus: A Practical Approach. [Citation Graph (0, 0)][DBLP]
    ICTAC, 2006, pp:332-346 [Conf]
  4. Andreas Podelski, Andrey Rybalchenko
    Transition Invariants. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:32-41 [Conf]
  5. 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]
  6. Byron Cook, Andreas Podelski, Andrey Rybalchenko
    Termination proofs for systems code. [Citation Graph (0, 0)][DBLP]
    PLDI, 2006, pp:415-426 [Conf]
  7. Andreas Podelski, Andrey Rybalchenko
    Transition predicate abstraction and fair termination. [Citation Graph (0, 0)][DBLP]
    POPL, 2005, pp:132-144 [Conf]
  8. 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]
  9. Byron Cook, Andreas Podelski, Andrey Rybalchenko
    Abstraction Refinement for Termination. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:87-101 [Conf]
  10. 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]
  11. 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]
  12. Dirk Beyer, Thomas A. Henzinger, Rupak Majumdar, Andrey Rybalchenko
    Path invariants. [Citation Graph (0, 0)][DBLP]
    PLDI, 2007, pp:300-309 [Conf]
  13. Byron Cook, Andreas Podelski, Andrey Rybalchenko
    Proving thread termination. [Citation Graph (0, 0)][DBLP]
    PLDI, 2007, pp:320-330 [Conf]
  14. Alexander Malkis, Andreas Podelski, Andrey Rybalchenko
    Precise Thread-Modular Verification. [Citation Graph (0, 0)][DBLP]
    SAS, 2007, pp:218-232 [Conf]
  15. 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]
  16. 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]

  17. Non-monotonic Refinement of Control Abstraction for Concurrent Programs. [Citation Graph (, )][DBLP]


  18. Heap Assumptions on Demand. [Citation Graph (, )][DBLP]


  19. Proving Conditional Termination. [Citation Graph (, )][DBLP]


  20. Cardinality Abstraction for Declarative Networking Applications. [Citation Graph (, )][DBLP]


  21. InvGen: An Efficient Invariant Generator. [Citation Graph (, )][DBLP]


  22. Constraint Solving for Program Verification: Theory and Practice by Example. [Citation Graph (, )][DBLP]


  23. Approximation and Randomization for Quantitative Information-Flow Analysis. [Citation Graph (, )][DBLP]


  24. Constraint Solving for Program Verification: Theory and Practice by Example. [Citation Graph (, )][DBLP]


  25. Finding heap-bounds for hardware synthesis. [Citation Graph (, )][DBLP]


  26. Operational Semantics for Declarative Networking. [Citation Graph (, )][DBLP]


  27. Verifying liveness for asynchronous programs. [Citation Graph (, )][DBLP]


  28. Proving non-termination. [Citation Graph (, )][DBLP]


  29. Thread-Modular Counterexample-Guided Abstraction Refinement. [Citation Graph (, )][DBLP]


  30. Automatic Discovery and Quantification of Information Leaks. [Citation Graph (, )][DBLP]


  31. Subsumer-First: Steering Symbolic Reachability Analysis. [Citation Graph (, )][DBLP]


  32. From Tests to Proofs. [Citation Graph (, )][DBLP]


  33. Invariant Synthesis for Combined Theories. [Citation Graph (, )][DBLP]


  34. Constraint Solving for Interpolation. [Citation Graph (, )][DBLP]


  35. Refinement type inference via abstract interpretation [Citation Graph (, )][DBLP]


  36. Applying Prolog to Develop Distributed Systems [Citation Graph (, )][DBLP]


Search in 0.225secs, Finished in 0.227secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002