The following pages link to (Q2754081):
Displayed 50 items.
- A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065) (← links)
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- Projecting transition systems: overcoming state explosion in concurrent system verification (Q300375) (← links)
- Effect-polymorphic behaviour inference for deadlock checking (Q338624) (← links)
- LCTD: test-guided proofs for C programs on LLVM (Q338629) (← links)
- Abstraction for model checking multi-agent systems (Q352029) (← links)
- Robust synthesis for real-time systems (Q386617) (← links)
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- \textsc{NeVer}: a tool for artificial neural networks verification (Q421446) (← links)
- SAT-based verification for timed component connectors (Q433331) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Verification of multi-linked heaps (Q439948) (← links)
- Consistency and refinement for interval Markov chains (Q444461) (← links)
- Deadlock checking by a behavioral effect system for lock handling (Q444480) (← links)
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata (Q479819) (← links)
- An extension of lazy abstraction with interpolation for programs with arrays (Q479820) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution (Q507359) (← links)
- Component-wise incremental LTL model checking (Q510894) (← links)
- SMT-based model checking for recursive programs (Q518396) (← links)
- Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement (Q533361) (← links)
- Competent predicate abstraction in model checking (Q543199) (← links)
- Predicate abstraction in a program logic calculus (Q549686) (← links)
- A game-based abstraction-refinement framework for Markov decision processes (Q600979) (← links)
- An invariant-based approach to the verification of asynchronous parameterized networks (Q604385) (← links)
- Abstraction and mining of traces to explain concurrency bugs (Q681463) (← links)
- An efficient approach for abstraction-refinement in model checking (Q690465) (← links)
- A shape graph logic and a shape system (Q744329) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- Verifying data refinements using a model checker (Q851129) (← links)
- Hybrid automata-based CEGAR for rectangular hybrid systems (Q888464) (← links)
- Combinatorial abstraction refinement for feasibility analysis of static priorities (Q892994) (← links)
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning (Q934706) (← links)
- Verification of evolving software via component substitutability analysis (Q934712) (← links)
- Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
- A framework for the verification of infinite-state graph transformation systems (Q937301) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- Equational abstractions (Q944377) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols (Q968361) (← links)
- Solving games via three-valued abstraction refinement (Q979079) (← links)
- Actor-based slicing techniques for efficient reduction of Rebeca models (Q988163) (← links)
- A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
- Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations (Q1039847) (← links)
- Integration of verification methods for program systems (Q1040327) (← links)
- Lattice-based refinement in bounded model checking (Q1629959) (← links)