Result: Faster analysis of formal specifications

Title:
Faster analysis of formal specifications
Authors:
BOUQUET, Fabrice, LEGEARD, Bruno, UTTING, Mark, VACELET, Nicolas
Source:
Formal methods and software engineering (Seattle WA, 8-12 November 2004)Lecture notes in computer science. :239-258
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 1 p.3/4
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énie logiciel, Software engineering, Développement logiciel, Software development, Desarrollo logicial, Extensibilité, Scalability, Estensibilidad, Langage modélisation unifié, Unified modelling language, Lenguaje UML, Modélisation, Modeling, Modelización, Méthode formelle, Formal method, Método formal, Orienté objet, Object oriented, Orientado objeto, Personnalisation, Customization, Personalización, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Raisonnement basé sur modèle, Model-based reasoning, Spécification formelle, Formal specification, Especificación formal, Théorie graphe, Graph theory, Teoría grafo, Validation test, Test validation, Validación prueba, Couverture test, Test coverage, Test cubierta, Génération test, Test generation, Generación prueba, Langage OCL, Object constraint language, Lenguaje forzado objeto
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratoire d'Informatique (LIFC), Université de Franche-Comté - CNRS - INRIA, 16, route de Gray, 25030 Besançon, France
University of Waikato, Hamilton, New Zealand
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=16334782
Rights:
Copyright 2005 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.16334782
Database:
PASCAL Archive

Further Information

When animating a formal model for validation or test generation purposes, scalability is a key issue. This paper describes a graph-based representation for the operations of state-based formal models. This representation makes it possible to handle large models efficiently and perform a variety of transformations, such as splitting an operation into separate behaviours, implementing various test coverage criteria for complex conditionals, removing inconsistent paths, factoring out common calculations, and executing the final operation using a customized constraint logic programming solver. The result is a fully automatic execution engine for state-based formal models such as B [Abr96], Z [Spi92] and UML with OCL preconditions and postconditions. It can be used for animation, test generation and other verification or validation purposes. Our experimental results on large industrial applications show that the transformations result in significant speedups.