The following pages link to VeriMAP (Q34655):
Displaying 13 items.
- Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (Q681335) (← links)
- Removing algebraic data types from constrained Horn clauses using difference predicates (Q2096439) (← links)
- Leveraging Horn clause solving for compositional verification of PLC software (Q2177778) (← links)
- Verification of time-aware business processes using constrained Horn clauses (Q2409725) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- Horn clauses as an intermediate representation for program analysis and transformation (Q4592995) (← links)
- Proving correctness of imperative programs by linearizing constrained Horn clauses (Q4593003) (← links)
- Incremental and Modular Context-sensitive Analysis (Q4957220) (← links)
- (Q5015369) (← links)
- (Q5015370) (← links)
- (Q5020652) (← links)
- (Q5020987) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)