Result: Constraint-based model checking of data-independent systems

Title:
Constraint-based model checking of data-independent systems
Authors:
SARNA-STAROSTA, Beata, RAMAKRISHNAN, C. R
Source:
Formal methods and software engineering (Singapore, 5-7 November 2003)Lecture notes in computer science. :579-598
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 28 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Généralités, General, Génie logiciel, Software engineering, Atteignabilité, Reachability, Asequibilidad, Automate, Automaton, Autómata, Configuration ordinateur, Computer configuration, Configuración ordenador, Développement logiciel, Software development, Desarrollo logicial, Groupe symétrie, Symmetry group, Grupo simetría, Logique linéaire, Linear logic, Lógica lineal, Logique temporelle, Temporal logic, Lógica temporal, Machine état fini, Finite state machine, Máquina estado finito, Modèle donnée, Data models, Mot infini, Infinite word, Palabra infinita, Méthode formelle, Formal method, Método formal, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Sécurité informatique, Computer security, Seguridad informatica, Vulnérabilité, Vulnerability, Vulnerabilidad, Vérification programme, Program verification, Verificación programa, Système état infini, Infinite state system, Vérification modèle, Model checking
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Science, State University of New York at Stony Brook, Stony Brook, New York, 11794-4400, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15714559
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15714559
Database:
PASCAL Archive

Further Information

Data-independent systems are an important class of infinite-state systems which can be subject to model checking by first building finite-state property-preserving abstractions. Exploiting data independence in practice involves user guidance, either in terms of the abstraction itself or in terms of symmetry properties of the system. In this paper we present a constraint-based verification technique that automatically handles data-independent systems. Our technique introduces a unified, automata-based model for infinite-state systems and LTL formulas. The technique can be seen as a generalization of explicit state model checker for reachability and LTL properties. We have implemented our technique using logic programming with tabulation and constraints. We also describe an extension to the automata model that permits verification of a richer class of systems. We show its power by analyzing configuration (security) vulnerabilities in a computer system.