Andrey Rybalchenko
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Supercharging plant configurations using Z3 | 2022-03-21 | Paper |
| Efficient CTL verification via Horn constraints solving | 2021-12-07 | Paper |
| Efficient CTL verification via Horn constraints solving (available as arXiv preprint) | 2021-12-07 | Paper |
| Generalised interpolation by solving recursion-free Horn clauses | 2021-06-28 | Paper |
| Generalised interpolation by solving recursion-free Horn clauses (available as arXiv preprint) | 2021-06-28 | Paper |
| Fast BGP simulation of large datacenters | 2020-01-23 | Paper |
| Predicate abstraction for program verification Handbook of Model Checking | 2018-07-20 | Paper |
| Symbolic polytopes for quantitative interpolation and verification | 2018-03-01 | Paper |
| Transition predicate abstraction and fair termination Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2017-07-14 | Paper |
| Scaling network verification using symmetry and surgery Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
| Horn clause solvers for program verification Fields of Logic and Computation II | 2015-09-22 | Paper |
| Verifying liveness for asynchronous programs Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-07-03 | Paper |
| Separation logic modulo theories Programming Languages and Systems | 2015-01-12 | Paper |
| Proving non-termination Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
| Proving that programs eventually do something good Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
| Predicate abstraction and refinement for verifying multi-threaded programs Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
| A constraint-based approach to solving games on infinite graphs Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| An epistemic perspective on consistency of concurrent computations CONCUR 2013 – Concurrency Theory | 2013-08-12 | Paper |
| Automation of quantitative information-flow analysis Lecture Notes in Computer Science | 2013-06-28 | Paper |
| Compositional termination proofs for multi-threaded programs Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
| Transition invariants and transition predicate abstraction for program termination Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
| Distributed and predictable software model checking Lecture Notes in Computer Science | 2011-02-15 | Paper |
| Constraint solving for interpolation Journal of Symbolic Computation | 2010-11-10 | Paper |
| Aligators for Arrays (Tool Paper) Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
| Non-monotonic refinement of control abstraction for concurrent programs Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
| Thread-modular counterexample-guided abstraction refinement Static Analysis | 2010-10-01 | Paper |
| Applying prolog to develop distributed systems Theory and Practice of Logic Programming | 2010-08-19 | Paper |
| Summarization for termination: No return! Formal Methods in System Design | 2010-02-05 | Paper |
| Cardinality Abstraction for Declarative Networking Applications Computer Aided Verification | 2009-06-30 | Paper |
| Verification, Model Checking, and Abstract Interpretation Lecture Notes in Computer Science | 2009-05-15 | Paper |
| Precise Thread-Modular Verification Static Analysis | 2009-03-03 | Paper |
| Model Checking Duration Calculus: A Practical Approach Lecture Notes in Computer Science | 2008-09-11 | Paper |
| Thread-Modular Verification Is Cartesian Abstract Interpretation Lecture Notes in Computer Science | 2008-09-11 | Paper |
| Model checking duration calculus: a practical approach Formal Aspects of Computing | 2008-08-21 | Paper |
| Proving Conditional Termination Computer Aided Verification | 2008-07-15 | Paper |
| Heap Assumptions on Demand Computer Aided Verification | 2008-07-15 | Paper |
| Constraint Solving for Interpolation Lecture Notes in Computer Science | 2008-04-04 | Paper |
| Invariant Synthesis for Combined Theories Lecture Notes in Computer Science | 2008-04-04 | Paper |
| Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL Model Checking and Artificial Intelligence | 2007-11-01 | Paper |
| Static Analysis Lecture Notes in Computer Science | 2006-10-31 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems Lecture Notes in Computer Science | 2005-11-10 | Paper |
Research outcomes over time
This page was built for person: Andrey Rybalchenko
