The following pages link to Maurizio Proietti (Q673494):
Displaying 50 items.
- Unfolding--definition--folding, in this order, for avoiding unnecessary variables in logic programs (Q673496) (← links)
- The list introduction strategy for the derivation of logic programs (Q699926) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- Relational verification through Horn clause transformation (Q1664383) (← links)
- Predicate pairing with abstraction for relational verification (Q1671163) (← links)
- Constraint-based correctness proofs for logic program transformations (Q1941873) (← links)
- Removing algebraic data types from constrained Horn clauses using difference predicates (Q2096439) (← links)
- Totally correct logic program transformations via well-founded annotations (Q2271905) (← links)
- Verification of time-aware business processes using constrained Horn clauses (Q2409725) (← links)
- (Q2723924) (← links)
- (Q2767091) (← 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)
- (Q3142026) (← links)
- A Rule-based Verification Strategy for Array Manipulating Programs (Q3187012) (← links)
- (Q3384903) (← links)
- A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs (Q3400572) (← links)
- Efficient generation of test data structures using constraint logic programming and program transformation (Q3458885) (← links)
- Deciding Full Branching Time Logic by Program Transformation (Q3558281) (← links)
- The Transformational Approach to Program Development (Q3578393) (← links)
- Transformations of logic programs on infinite lists (Q3585155) (← links)
- Automatic Correctness Proofs for Logic Program Transformations (Q3608667) (← links)
- (Q3784070) (← links)
- (Q4038669) (← links)
- (Q4287480) (← links)
- Transformation of logic programs: Foundations and techniques (Q4305629) (← links)
- (Q4391453) (← links)
- (Q4421875) (← 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)
- (Q4707742) (← links)
- (Q4808811) (← links)
- Transformations of logic programs with goals as arguments (Q4819011) (← links)
- Synthesizing Concurrent Programs Using Answer Set Programming (Q4902316) (← links)
- Using Real Relaxations during Program Specialization (Q4909316) (← links)
- Synthesis and transformation of logic programs using unfold/fold proofs (Q4939537) (← 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)
