Procedure-modular verification of control flow safety properties

Soleimanifard, Siavash; Gurov, Dilian; Huisman, Marieke

doi:10.1145/1924520.1924525

Cited by 5 publications

(4 citation statements)

References 14 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, ProMoVer provides support for proof reuse, and specification extraction, a collection of ready-formalised properties, and translates between the different intermediate formats and formalisms. Preliminary results on an earlier version of ProMoVer were reported at a workshop [21]. The present paper extends and completes this work.…”

Section: Introductionsupporting

confidence: 72%

Software Engineering and Formal Methods

Barthe¹,

Pardo²,

Schneider³

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper describes ProMoVer, a tool for fully automated procedure-modular verification of Java programs equipped with methodlocal and global assertions that specify safety properties of sequences of method invocations. Modularity at the procedure-level is a natural instantiation of the modular verification paradigm, where correctness of global properties is relativized on the local properties of the methods rather than on their implementations, and is based here on the construction of maximal models for a program model that abstracts away from program data. This approach allows global properties to be verified in the presence of code evolution, multiple method implementations (as arising from software product lines), or even unknown method implementations (as in mobile code for open platforms). ProMoVer automates a typical verification scenario for a previously developed tool set for compositional verification of control flow safety properties, and provides appropriate pre-and post-processing. Modularity is exploited by a mechanism for proof reuse that detects and minimizes the verification tasks resulting from changes in the code and the specifications. The verification task is relatively light-weight due to support for abstraction from private methods and automatic extraction of candidate specifications from method implementations. We evaluate the tool on a number of applications from the smart card domain.

show abstract

Section: Introductionsupporting

confidence: 72%

Software Engineering and Formal Methods

Barthe¹,

Pardo²,

Schneider³

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…ProMoVer [26] is a fully automated tool for the procedure-modular verification of control flow temporal safety properties of Java programs 3 . It supports compositional verification by relativizing the correctness of a global program property on properties of individual methods and their public interfaces.…”

Section: Tool Support and Evaluationmentioning

confidence: 99%

Compositional Algorithmic Verification of Software Product Lines

Schaefer

Gurov

Soleimanifard

2011

Formal Methods for Components and Objects

Self Cite

View full text Add to dashboard Cite

Abstract. Software product line engineering allows large software systems to be developed and adapted for varying customer needs. The products of a software product line can be described by means of a hierarchical variability model specifying the commonalities and variabilities between the artifacts of the individual products. The number of products generated by a hierarchical model is exponential in its size, which poses a serious challenge to software product line analysis and verification. For an analysis technique to scale, the effort has to be linear in the size of the model rather than linear in the number of products it generates. Hence, efficient product line verification is only possible if compositional verification techniques are applied that allow the analysis of products to be relativized on the properties of their variation points. In this paper, we propose simple hierarchical variability models (SHVM) with explicit variation points as a novel way to describe a set of products consisting of sets of methods. SHVMs provide a trade-off between expressiveness and a clean and simple model suitable for compositional verification. We generalize a previously developed compositional technique and tool set for the automatic verification of control-flow based temporal safety properties to product lines defined by SHVMs, and prove soundness of the generalization. The desired property relativization is achieved by introducing variation point specifications. We evaluate the proposed technique on a number of test cases.

show abstract

“…Throughout this section, we use the Java program shown in Figure 4 as a running example. This program was also used as a means of illustration in our previous work [32]. Readers can compare models and properties shown in the subsequent subsections with those of [32].…”

Section: Instantiation Of the Framework With Full Data Abstractionmentioning

confidence: 99%

“…This program was also used as a means of illustration in our previous work [32]. Readers can compare models and properties shown in the subsequent subsections with those of [32]. In this example we consider method even as a variable component.…”

Section: Instantiation Of the Framework With Full Data Abstractionmentioning

confidence: 99%

Algorithmic Verification of Procedural Programs in the Presence of Code Variability

Soleimanifard

Gurov

2015

Formal Aspects of Component Software

Self Cite

View full text Add to dashboard Cite

We present a generic framework for verifying temporal safety properties of procedural programs that are dynamically or statically configured by replacing, adapting, or adding new components. To deal with such a variability of a program, we require programmers to provide local specifications for its variable components, and verify the global properties by replacing these specifications with maximal models. Our framework is a generalization of a previously developed framework that abstracts from all program data. In this work, we capture program data and thus significantly increase the range of properties that can be verified. Our framework is generic by being parametric on the set of observed program events and their semantics. We separate program structure from the behavior it induces to facilitate independent component specification and verification. To exemplify its use, we instantiate our framework to develop a compositional verification technique for programs written in a procedural language with pointers as the only datatype. We also adapt our previously developed toolset to provide support for compositional verification of such programs.

show abstract

Procedure-modular verification of control flow safety properties

Cited by 5 publications

References 14 publications

Software Engineering and Formal Methods

Software Engineering and Formal Methods

Compositional Algorithmic Verification of Software Product Lines

Algorithmic Verification of Procedural Programs in the Presence of Code Variability

Contact Info

Product

Resources

About