The following pages link to Andrey Rybalchenko (Q604393):
Displayed 39 items.
- Constraint solving for interpolation (Q604394) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- Symbolic polytopes for quantitative interpolation and verification (Q1702919) (← links)
- Supercharging plant configurations using Z3 (Q2117195) (← links)
- Fast BGP simulation of large datacenters (Q2287099) (← links)
- Scaling network verification using symmetry and surgery (Q2828246) (← links)
- An Epistemic Perspective on Consistency of Concurrent Computations (Q2842109) (← links)
- Compositional Termination Proofs for Multi-threaded Programs (Q2894275) (← links)
- Separation Logic Modulo Theories (Q2937786) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- Transition Invariants and Transition Predicate Abstraction for Program Termination (Q3000631) (← links)
- Distributed and Predictable Software Model Checking (Q3075493) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- Proving that programs eventually do something good (Q3189807) (← links)
- Proving non-termination (Q3189834) (← links)
- Heap Assumptions on Demand (Q3512501) (← links)
- Proving Conditional Termination (Q3512502) (← links)
- Thread-Modular Verification Is Cartesian Abstract Interpretation (Q3525149) (← links)
- Model Checking Duration Calculus: A Practical Approach (Q3525159) (← links)
- Applying Prolog to develop distributed systems (Q3585178) (← links)
- Precise Thread-Modular Verification (Q3612004) (← links)
- Cardinality Abstraction for Declarative Networking Applications (Q3636882) (← links)
- Thread-Modular Counterexample-Guided Abstraction Refinement (Q4930739) (← links)
- Non-monotonic Refinement of Control Abstraction for Concurrent Programs (Q4931292) (← links)
- Aligators for Arrays (Tool Paper) (Q4933316) (← links)
- (Q4997234) (← links)
- (Q5015366) (← links)
- Verifying liveness for asynchronous programs (Q5261509) (← links)
- Transition predicate abstraction and fair termination (Q5276141) (← links)
- Automation of Quantitative Information-Flow Analysis (Q5300883) (← links)
- A constraint-based approach to solving games on infinite graphs (Q5408418) (← links)
- Predicate abstraction and refinement for verifying multi-threaded programs (Q5408554) (← links)
- Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL (Q5423882) (← links)
- Constraint Solving for Interpolation (Q5452619) (← links)
- Invariant Synthesis for Combined Theories (Q5452621) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703800) (← links)
- Static Analysis (Q5897430) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5901912) (← links)