The following pages link to Fabio Fioravanti (Q1664382):
Displayed 38 items.
- Relational verification through Horn clause transformation (Q1664383) (← links)
- Predicate pairing with abstraction for relational verification (Q1671163) (← links)
- Removing algebraic data types from constrained Horn clauses using difference predicates (Q2096439) (← links)
- Verification of time-aware business processes using constrained Horn clauses (Q2409725) (← links)
- Controlling Polyvariance for Specialization-based Verification (Q2841959) (← links)
- Specialization with Constrained Generalization for Software Model Checking (Q2848896) (← links)
- Proving Theorems by Program Transformation (Q2865083) (← links)
- Verifying Array Programs by Transforming Verification Conditions (Q2938066) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← links)
- Combining Logic Programs and Monadic Second Order Logics by Program Transformation (Q3079918) (← links)
- A Rule-based Verification Strategy for Array Manipulating Programs (Q3187012) (← links)
- (Q3384903) (← links)
- Efficient generation of test data structures using constraint logic programming and program transformation (Q3458885) (← links)
- (Q4421875) (← links)
- (Q4475692) (← links)
- (Q4499254) (← links)
- Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806) (← links)
- Program Verification using Constraint Handling Rules and Array Constraint Generalizations* (Q4589602) (← links)
- Proving correctness of imperative programs by linearizing constrained Horn clauses (Q4593003) (← links)
- Predicate Pairing for program verification (Q4644353) (← links)
- (Q4808811) (← links)
- Using Real Relaxations during Program Specialization (Q4909316) (← links)
- Solving Horn Clauses on Inductive Data Types Without Induction – ERRATUM (Q4957191) (← links)
- (Q4994693) (← links)
- (Q4997232) (← links)
- (Q5015370) (← links)
- (Q5016384) (← links)
- (Q5020652) (← links)
- Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (Q5038461) (← links)
- Generalization strategies for the verification of infinite state systems (Q5299583) (← links)
- Semantics and Controllability of Time-Aware Business Processes* (Q5377319) (← links)
- (Q5701513) (← links)
- Program Development in Computational Logic (Q5712537) (← links)
- Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach (Q5862477) (← links)
- Improving Reachability Analysis of Infinite State Systems by Specialization (Q5894983) (← links)
- Improving Reachability Analysis of Infinite State Systems by Specialization (Q5895015) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
- (Q6197213) (← links)