• Extracting a data flow analyse...

Treffer: Extracting a data flow analyser in constructive logic

Title:
Extracting a data flow analyser in constructive logic
Authors:
CACHERA, David, JENSEN, Thomas, PICHARDIE, David, RUSU, Vlad
Source:
Applied Semantics: Selected TopicsTheoretical computer science. 342(1):56-78
Publisher Information:
Amsterdam: Elsevier, 2005.
Publication Year:
2005
Physical Description:
print, 22 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Théorie de la preuve et mathématiques constructives, Proof theory and constructive mathematics, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Logiciel, Software, Génie logiciel, Software engineering, Analyse flux donnée, Data flow analysis, Analyse programme, Program analysis, Análisis programa, Construction modulaire, Modular construction, Construcción modular, Démonstration théorème, Theorem proving, Demostración teorema, Existence solution, Existence of solution, Existencia de solución, Flux donnée, Data flow, Flujo datos, Foncteur, Functor, Informatique théorique, Computer theory, Informática teórica, Langage spécification, Specification language, Lenguaje especificación, Sémantique opérationnelle, Operational semantics, Semantica operacional, Treillis, Lattice, Enrejado, Logique constructive, Constructive logic, Solution contrainte, Constraint solving, Lattices
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
IRISA/ENS Cachan (Bretagne), Campus de Beaulieu, 35042 Rennes, France
IRISA/CNRS, Campus de Beaulieu, 35042 Rennes, France
IRISA/INRIA, Campus de Beaulieu, 35042 Rennes, France
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17042592
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

Mathematics
Accession Number:
edscal.17042592
Database:
PASCAL Archive

Weitere Informationen

A constraint-based data flow analysis is formalised in the specification language of the Coq proof assistant. This involves defining a dependent type of lattices together with a library of lattice functors for modular construction of complex abstract domains. Constraints are represented in a way that allows for both efficient constraint resolution and correctness proof of the analysis with respect to an operational semantics. The proof of existence of a solution to the constraints is constructive which means that the extraction mechanism of Coq provides a provably correct data flow analyser in Ocaml from the proof. The library of lattices and the representation of constraints are defined in an analysis-independent fashion that provides a basis for a generic framework for proving and extracting static analysers in Coq.