Using real relaxations during program specialization

Authors:
Fabio Fioravanti;Alberto Pettorossi;Maurizio Proietti;Valerio Senni
Affiliations:
Dipartimento di Scienze, University ‘G. D'Annunzio', Pescara, Italy;DISP, University of Rome Tor Vergata, Rome, Italy;CNR-IASI, Rome, Italy;DISP, University of Rome Tor Vergata, Rome, Italy,LORIA-INRIA, Villers-les-Nancy, France
Venue:
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Year:
2011

Citing 29
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Toward the partial evaluation of CLP languages

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A practical algorithm for exact array dependence analysis

Communications of the ACM
Partial evaluation and automatic program generation

Partial evaluation and automatic program generation
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
Transformations of CLP modules

Theoretical Computer Science
Model checking

Model checking
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Decompositional Approach for Computing Least Fixed-Pointsof Datalog Programs with Z-Counters

Constraints
Partial Evaluation in Constraint Logic Programming

ISMIS '96 Proceedings of the 9th International Symposium on Foundations of Intelligent Systems
Mona: Monadic Second-Order Logic in Practice

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Constraint Logic Programming Applied to Model Checking

LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Infinite State Model Checking by Abstract Interpretation and Program Specialisation

LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation
Automated Strategies for Specializing Constraint Logic Programs

LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction

CL '00 Proceedings of the First International Conference on Computational Logic
TReX: A Tool for Reachability Analysis of Complex Systems

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Logic program specialisation through partial deduction: Control issues

Theory and Practice of Logic Programming
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

Science of Computer Programming
FAST: acceleration from theory to practice

International Journal on Software Tools for Technology Transfer (STTT)
Analysis of Linear Hybrid Systems in CLP

Logic-Based Program Synthesis and Transformation
On Negative Unfolding in the Answer Set Semantics

Logic-Based Program Synthesis and Transformation
Action Language verifier: an infinite-state model checker for reactive software specifications

Formal Methods in System Design
Convex hull abstractions in specialization of CLP programs

LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Vector addition system reachability problem: a short self-contained proof

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraint-based abstract semantics for temporal logic: a direct approach to design and implementation

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Program specialization for verifying infinite state systems: an experimental evaluation

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Flat counter automata almost everywhere!

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a program specialization technique for locally stratified CLP(ℤ) programs, that is, logic programs with linear constraints over the set ℤ of the integer numbers. For reasons of efficiency our technique makes use of a relaxation from integers to reals. We reformulate the familiar unfold/fold transformation rules for CLP programs so that: (i) the applicability conditions of the rules are based on the satisfiability or entailment of constraints over the set ℝ of the real numbers, and (ii) every application of the rules transforms a given program into a new program with the same perfect model constructed over ℤ. Then, we introduce a strategy which applies the transformation rules for specializing CLP(ℤ) programs with respect to a given query. Finally, we show that our specialization strategy can be applied for verifying properties of infinite state reactive systems specified by constraints over ℤ.