Dependency Analysis of Functional Specifications with Algebraic Data Structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Dependency Analysis of Functional Specifications with Algebraic Data Structures

Abstract

In the context of interactive formal verification of complex systems, much effort is spent on proving the preservation of the systems invariants. However, most operations have a localized effect on the system, which only really impacts few invariants at the same time. Identifying those invariants that are unaffected by an operation can substantially ease the proof burden for the programmer. We present a dependency analysis for a strongly-typed, functional language, which computes a conservative approximation of the input fragments on which the operations depend. It is a flow-sensitive interprocedural analysis that handles arrays, structures and variant data types. For the latter, it simultaneously computes a subset of possible constructors. We have validated the scalability of the analysis to complex transition systems by applying it to a functional specification of the MINIX operating system.
No file

Dates and versions

hal-01243002 , version 1 (14-12-2015)

Identifiers

Cite

Oana Andreescu, Thomas Jensen, Stephane Lescuyer. Dependency Analysis of Functional Specifications with Algebraic Data Structures. 17th International Conference on Formal Engineering Methods, ICFEM 2015, Michael Butler Sylvain Conchon Fatiha Zaïdi, Nov 2015, Paris, France. pp.18, ⟨10.1007/978-3-319-25423-4_8⟩. ⟨hal-01243002⟩
195 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More