Abstract Diagnosis for tccp using a Linear Temporal Logic

Automatic techniques for program verification usually suffer the well-known state explosion problem. Most of the classical approaches are based on browsing the structure of some form of model (which represents the behavior of the program) to check if a given specification is valid. This implies that...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 14; no. 4-5; pp. 787 - 801
Main Authors: COMINI, MARCO, TITOLO, LAURA, VILLANUEVA, ALICIA
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2014
Subjects:
Automation
Construction
Explosions
Logic programming
Proposals
Regular Papers
Semantics
Specifications
Temporal logic
linear temporal logic
decision procedures
program verification
concurrent constraint paradigm
abstract diagnosis
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Automatic techniques for program verification usually suffer the well-known state explosion problem. Most of the classical approaches are based on browsing the structure of some form of model (which represents the behavior of the program) to check if a given specification is valid. This implies that a part of the model has to be built, and sometimes the needed fragment is quite huge. In this work, we provide an alternative automatic decision method to check whether a given property, specified in a linear temporal logic, is valid w.r.t. a tccp program. Our proposal (based on abstract interpretation techniques) does not require to build any model at all. Our results guarantee correctness but, as usual when using an abstract semantics, completeness is lost.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068414000349