12,872 Hits in 3.9 sec

Verification of Imperative Programs by Constraint Logic Program Transformation

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2013 Electronic Proceedings in Theoretical Computer Science  
We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs  ...  First, we encode the correctness of an imperative program, say prog, as the negation of a predicate 'incorrect' defined by a CLP program T.  ...  We would like to thank Anindya Banerjee, Olivier Danvy, Kyung-Goo Doh, and John Hatcliff for their kind invitation to contribute to this symposium in honor of Dave Schmidt.  ... 
doi:10.4204/eptcs.129.12 fatcat:ot54j7sol5errm7cryxolqywcy

Introduction to the special issue on computational logic for verification

2018 Theory and Practice of Logic Programming  
The last decade has witnessed a growing interest in the use of computational logic methods for program verification.  ...  It has attracted researchers from both computational logic and program verification communities, giving rise to a fruitful exchange of ideas and experiences.  ...  Furthermore, the extensive literature on analysis and transformation techniques for Constraint Logic Programs (CLPs) (Jaffar and Maher 1994) , a particular case of CHCs, can now be also applied to improve  ... 
doi:10.1017/s1471068418000029 fatcat:c4gxiijazzgohk6shsfnb5p6cy

Removing Unnecessary Variables from Horn Clause Verification Conditions

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2016 Electronic Proceedings in Theoretical Computer Science  
Verification conditions (VCs) are logical formulas whose satisfiability guarantees program correctness.  ...  which are not required for the correctness proofs of the programs under verification.  ...  Now we present an extension to constraint logic programs of the FAR algorithm presented in [7] for removing redundant arguments from logic programs.  ... 
doi:10.4204/eptcs.219.5 fatcat:3zpyhdp5xfh4zjvnzywnf46jtq

Software Model Checking by Program Specialization

Emanuele De Angelis, Marc Herbstritt
2012 International Conference on Logic Programming  
We introduce a general verification framework based on program specialization to prove properties of the runtime behaviour of imperative programs.  ...  Given a program P written in a programming language L and a property ϕ in a logic M , we can verify that ϕ holds for P by: (i) writing an interpreter I for L and a semantics S for M in a suitable metalanguage  ...  In particular, it could be necessary to resort to more sophisticated logic program transformations based on the unfold/fold method.  ... 
doi:10.4230/lipics.iclp.2012.439 dblp:conf/iclp/Angelis12 fatcat:37jeza5ccbbhbgwbqpghzjfi4y

Program verification via iterated specialization

E. De Angelis, F. Fioravanti, A. Pettorossi, M. Proietti
2014 Science of Computer Programming  
We present a method for verifying properties of imperative programs by using techniques based on the specialization of constraint logic programs (CLP).  ...  (i) The adaptation and the integration of various techniques for specializing and transforming constraint logic programs into the novel iterated specialization method for verifying imperative programs.  ...  verification of imperative programs [12, 40] ).  ... 
doi:10.1016/j.scico.2014.05.017 fatcat:5th77b243fdhdpcwvoyhtuzmp4

Proving correctness of imperative programs by linearizing constrained Horn clauses

2015 Theory and Practice of Logic Programming  
AbstractWe present a method for verifying the correctness of imperative programs which is based on the automated transformation of their specifications.  ...  arithmetic (LA) constraints in their premise (also calledconstrained Horn clauses).  ...  Improving LA-solving by Transforming Verification Conditions • Possible solution: More powerful constraint theories, but decidability of entailment is lost for non-linear polynomials [Matijasevic 70].  ... 
doi:10.1017/s1471068415000289 fatcat:3avbtyt3tjhshad3tnq4pcwv4i

Verifying Array Programs by Transforming Verification Conditions [chapter]

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
2014 Lecture Notes in Computer Science  
Our approach provides a very rich program verification framework where one can compose together several verification strategies, each of them being implemented by transformations of CLP(Array) programs  ...  The interpreter (that is, the operational semantics) of the program is specified as a set of Horn clauses with constraints in the domain of integer arrays, also called constraint logic programs over integer  ...  Introduction Horn clauses and constraints have been advocated by many researchers as suitable logical formalisms for the automated verification of imperative programs [2, 19, 34] .  ... 
doi:10.1007/978-3-642-54013-4_11 fatcat:f347lp3cwndclmjj7qprwc2r4e

Page 1757 of Mathematical Reviews Vol. , Issue 95c [page]

1995 Mathematical Reviews  
From the summary: “In this paper we describe progress towards a theory of transformational program development.  ...  Summary: “The temporal logic model-checking method is very useful for verifying concurrent programs that can be expressed by finite-state transition systems.  ... 

Proving or Disproving likely Invariants with Constraint Reasoning [article]

Tristan Denmat, Arnaud Gotlieb, Mireille Ducasse
2005 arXiv   pre-print
A program invariant is a property that holds for every execution of the program. Recent work suggest to infer likely-only invariants, via dynamic analysis.  ...  We propose a constraint-based reasoning approach that is able, unlike other approaches, to both prove or disprove likely invariants. In the latter case, our approach provides counter-examples.  ...  The difference is the use of constraint logic to express the semantics of an imperative language instead of pure Horn logic.  ... 
arXiv:cs/0508108v1 fatcat:mtup32gurzblncgkn6ywjbkxfa

An overview of the Leon verification system

Régis Blanc, Viktor Kuncak, Etienne Kneuss, Philippe Suter
2013 Proceedings of the 4th Workshop on Scala - SCALA '13  
We present the Leon verification system for a subset of the Scala programming language.  ...  Both properties and programs in Leon are expressed in terms of user-defined functions.  ...  The procedure is inspired by the generation of verification conditions for imperative programs [11, 15, 28] .  ... 
doi:10.1145/2489837.2489838 dblp:conf/ecoop/BlancKKS13 fatcat:mjnxrne4p5bw7gt5wsnamyp75a

HMC: Verifying Functional Programs Using Abstract Interpreters [article]

Ranjit Jhala and Rupak Majumdar and Andrey Rybalchenko
2010 arXiv   pre-print
Next, it transforms the logical refinement constraints into a simple first-order imperative program that is safe iff the constraints are satisfiable.  ...  First, it uses the type structure of the functional program to generate a set of logical refinement constraints whose satisfaction implies the safety of the source program.  ...  A Imperative Programs RTI translates the satisfiability problem for refinement type constraints to the question of checking the safety of an imperative program in a simple imperative language IMP.  ... 
arXiv:1004.2884v2 fatcat:6wuicdztc5b5tkh5z6ti6aeqzi

Imperative Program Synthesis from Answer Set Programs

Sarat Chandra Varanasi
2019 Electronic Proceedings in Theoretical Computer Science  
We are currently working on synthesizing imperative programs from ASP programs by turning the negation into useful computations.  ...  Our research concerns generating imperative programs from Answer Set Programming Specifications. ASP is highly declarative and is ideal for writing specifications.  ...  We want to transform them into meaningful and efficient imperative programs.  ... 
doi:10.4204/eptcs.306.55 fatcat:ptveajo7xngn5przh7bbltfxzu

Combining Logic and Algebraic Techniques for Program Verification in Theorema

Laura Kovács, Nikolaj Popov, Tudor Jebelean
2006 Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006)  
We study and implement concrete methods for the verification of both imperative as well as functional programs in the frame of the Theorema system.  ...  The distinctive features of our approach consist in the automatic generation of loop invariants (by using combinatorial and algebraic techniques), and the generation of verification conditions as first-order  ...  As usual, program correctness is transformed into a set of first-order predicate logic formulae by a Verification Condition Generator (VCG) -a device, which takes the program (its source text) and the  ... 
doi:10.1109/isola.2006.46 dblp:conf/isola/KovacsPJ06 fatcat:sdw5uxm4fnf3dmwsyzwi4cgyly

Page 5988 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
In concurrent constraint logic programming a program is executed by concurrently working agents which add and check constraints on a shared set of variables, and whose behaviour is described by a set of  ...  Summary: “The meaning of an imperative program is defined to be the precondition of the executions as a function of proposed behav- iour.  ... 

Enhancing Predicate Pairing with Abstraction for Relational Verification [article]

Emanuele De Angelis , Maurizio Proietti DEC, University G. D'Annunzio, Chieti-Pescara, Italy, IASI-CNR, Roma, Italy)
2017 arXiv   pre-print
Relational verification is a technique that aims at proving properties that relate two different program fragments, or two different program runs.  ...  of its subdomains) during the transformation.  ...  These compositions of transformations are applied to sets of CHCs encoding relational properties of imperative programs.  ... 
arXiv:1709.04809v1 fatcat:dsg5k46kmvagpkwobge35ogsiy
« Previous Showing results 1 — 15 out of 12,872 results