The following pages link to Valerio Senni (Q1941872):
Displaying 20 items.
- Constraint-based correctness proofs for logic program transformations (Q1941873) (← links)
- Controlling Polyvariance for Specialization-based Verification (Q2841959) (← links)
- Proving Theorems by Program Transformation (Q2865083) (← links)
- Applying Mean-Field Approximation to Continuous Time Markov Chains (Q2937739) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← links)
- Modular Termination and Combinability for Superposition Modulo Counter Arithmetic (Q3172895) (← 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)
- Using Real Relaxations during Program Specialization (Q4909316) (← links)
- Programming and Verifying Component Ensembles (Q5170744) (← links)
- Generalization strategies for the verification of infinite state systems (Q5299583) (← links)
- Transformational Verification of Parameterized Protocols Using Array Formulas (Q5302878) (← links)
- Proving Properties of Constraint Logic Programs by Eliminating Existential Variables (Q5449600) (← links)
- A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (Q5504662) (← links)
- Improving Reachability Analysis of Infinite State Systems by Specialization (Q5894983) (← links)
- Improving Reachability Analysis of Infinite State Systems by Specialization (Q5895015) (← links)
