Pages that link to "Item:Q2947164"
From MaRDI portal
The following pages link to Horn Clause Solvers for Program Verification (Q2947164):
Displayed 44 items.
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (Q831915) (← links)
- Symbol elimination and applications to parametric entailment problems (Q831921) (← links)
- On the copy complexity of width 3 Horn constraint systems (Q831922) (← links)
- Constraint-based relational verification (Q832229) (← links)
- Decision tree learning in CEGIS-based termination analysis (Q832251) (← links)
- Progress in certifying hardware model checking results (Q832275) (← links)
- A tree-based approach to data flow proofs (Q1629956) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Counterexample-guided prophecy for model checking modulo the theory of arrays (Q2044196) (← links)
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations (Q2095546) (← links)
- Removing algebraic data types from constrained Horn clauses using difference predicates (Q2096439) (← links)
- Subsumption demodulation in first-order theorem proving (Q2096454) (← links)
- Reasoning in the theory of heap: satisfiability and interpolation (Q2119112) (← links)
- Toward neural-network-guided program synthesis and verification (Q2145332) (← links)
- Symbolic automatic relations and their applications to SMT and CHC solving (Q2145347) (← links)
- Exact and parameterized algorithms for read-once refutations in Horn constraint systems (Q2151419) (← links)
- Loop verification with invariants and contracts (Q2152642) (← links)
- Leveraging Horn clause solving for compositional verification of PLC software (Q2177778) (← links)
- Deciding the Bernays-Schoenfinkel fragment over bounded difference constraints by simple clause learning over theories (Q2234101) (← links)
- Analyzing read-once cutting plane proofs in Horn systems (Q2673307) (← links)
- Proof Relevant Corecursive Resolution (Q2798268) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806) (← links)
- Introduction to the special issue on computational logic for verification (Q4644352) (← links)
- Predicate Pairing for program verification (Q4644353) (← links)
- Tree dimension in verification of constrained Horn clauses (Q4644355) (← links)
- Incremental and Modular Context-sensitive Analysis (Q4957220) (← links)
- (Q5015368) (← links)
- (Q5016384) (← links)
- (Q5020649) (← links)
- (Q5020652) (← links)
- (Q5020662) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)
- Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays (Q5043584) (← links)
- Computing Abstract Distances in Logic Programs (Q5097625) (← links)
- Fold/Unfold Transformations for Fixpoint Logic (Q5164174) (← links)
- ICE-based refinement type discovery for higher-order functional programs (Q5919002) (← links)
- Abstraction refinement and antichains for trace inclusion of infinite state systems (Q5919079) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
- Parameterized recursive refinement types for automated program verification (Q6109429) (← links)
- Towards a dereversibilizer: fewer asserts, statically (Q6148113) (← links)
- Efficient modular SMT-based model checking of pointer programs (Q6164428) (← links)
- (Q6197214) (← links)
- (Q6197216) (← links)