• Aucun résultat trouvé

Tutorial on Analysis and Verification of Imperative Programs through CLP

N/A
N/A
Info
Télécharger
Protected

Academic year: 2022

Partager "Tutorial on Analysis and Verification of Imperative Programs through CLP"

Copied!
1
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

(1)

Technical Communications of ICLP 2015. Copyright with the Authors. 1

Tutorial on Analysis and Verification of Imperative Programs through CLP∗

John Gallagher

Roskilde University, Denmark and IMDEA Software Institute, Spain (e-mail:jpg@ruc.dk)

Abstract

In this tutorial we show how constraint logic programs (CLP) provide a flexible framework for analysis and verification of other languages. Here the focus is on analysing imperative programming languages. It is first necessary to translate a given imperative program into CLP clauses. Different approaches to automatic translation based on small-step or big- step semantics will be shown, along with their advantages and disadvantages. The role of query-answer transforms in the translation process is also presented. The problem of analysing or verifying properties of an imperative program is thus translated into a CLP analysis or verification problem. The main CLP analysis technique covered in this tutorial is the computation of approximate models of CLP clauses using abstract interpretation over numeric or symbolic abstract domains. The tutorial contains a survey of analysis and verification problems for imperative programs that have been successfully tackled in this way, including verification of safety properties in sequential and concurrent programs, termination, resource analysis and shape analysis.

∗Some of the contents of this tutorial resulted from support from EU FP7 project 318337,ENTRA - Whole-Systems Energy Transparencyand Danish Research Council grant FNU-10-084290.

Références

Télécharger maintenant ( PDF - 1 Page - 98.58 KB )

Documents relatifs

Relational properties for specification and verification of C programs in Frama-C

• Loop invariants are written using the clause loop invariant I and have the same semantic as loop invariants in Hoare logic (Section 3.3): I holds in state before the loop, and for

Proof of Imperative Programs in Type Theory.

In this paper, we establish a relation between these two approaches and show how proofs in Hoare logic can be interpreted in type theory, yielding a translation of imperative

Synthesis of high molecular weight poly(p-benzamide)s

We first polymerized M1 (0.5 M) in dry THF using LiHMDS as the base and phenyl benzoate as the initiator varying the temperature from −20 °C to room temperature as well as the monomer

Plasma in spark plasma sintering of ceramic particle compacts

The formation of a thin liquid layer at the particle sur- faces or surface softening, due to the plasma, will release the stress concentration due to the particle morphology, and

Exotic Transverse-Vortex Magnetic Configurations in CoNi Nanowires

Electron holography evidences the exist- ence of a complex exotic magnetic configuration characterized by two distinctly different types of magnetic con- figurations within a

Impact of APOL1 Genetic Variants on HIV-1 Infection and Disease Progression

In this genetic epidemiological study of an HIV-1 at-risk and natural progression cohort, we observed no evidence of association between APOL1 renal risk alleles and HIV-1

Analyse-Algèbre 4

On suppose que f est Lipschitzienne de rapport k (i.e. L’exercice 2 est clq, sauf sa derni`ere question que je classe en diffc. Le dernier exercice est plus th´eorique. Ces

Gestion multi-agents d'un terminal à conteneurs

L’objectif de cette thèse est de développer un modèle multi-agents pour simuler les opérations de manutention et de transfert de conteneurs entre le terminal multimodal