Generating JML Specifications from Alloy Expressions

Grunwald, Daniel; Gladisch, Christoph; Liu, Tianhai; Taghdiri, Mana; Tyszberowicz, Shmuel

doi:10.1007/978-3-319-13338-6_9

Cited by 4 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The JML specifications are more difficult to read than those of the linked list example (hence the motivation for using Alloy), yet they are readable enough to enable the user to provide lemmas for the proof. Further, we explore the possibility of modifying these specifications to achieve compatibility also with testing, an issue that was not considered in [32].…”

Section: Applying the Approach To Treesmentioning

confidence: 99%

“…In [32] we have used queries to specify and verify the add operation of a tree data structure. To the best of our knowledge, this is the first standard JML specification of a tree modifier method that has been used to deductively verify the implementation.…”

Section: Applying the Approach To Treesmentioning

confidence: 99%

“…11 Together with others we thus have developed the Alloy2JML tool [34,32]. It generates, for example, the JML expression (1) from the Alloy expression (2).…”

Section: Enabling Runtime Checkingmentioning

confidence: 99%

See 2 more Smart Citations

Specifying linked data structures in JML for combining formal verification and testing

Gladisch

Tyszberowicz

2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

We show how to write concise and readable specifications of linked data structures that are applicable for both formal deductive verification and testing. A singly linked list and a binary search tree are provided as examples. The main characteristic of the specifications is the use of observer methods, in particular to express reachability of elements in a data structure. The specifications are written in the Java Modeling Language (JML) and do not require extensions of that language. This paper addresses a mixed audience of users and developers in the fields of formal verification, testing, and specification language design. We provide an in-depth description of the proposed specifications and analyze the implications both for verification and testing. Based on this analysis we have developed verification techniques that are implemented in the deductive verification tool KeY and enable fully automatic verification of the linked list example. This techniques are also described in this paper.

show abstract

Section: Applying the Approach To Treesmentioning

confidence: 99%

Section: Applying the Approach To Treesmentioning

confidence: 99%

See 1 more Smart Citation

Specifying linked data structures in JML for combining formal verification and testing

Gladisch

Tyszberowicz

2015

Science of Computer Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the last decades relational modeling and model finding has been used to solve problems in a wide range of domains, from security [8], program verification and testing [14,16], to enterprise modeling [3]. 1 Since many computational problems have relational structures relational model finding has shown to be a powerful and useful method.…”

Section: Introductionmentioning

confidence: 99%

AlleAlle: bounded relational model finding with unbounded data

Stoel

Storm

Vinju

2019

Proceedings of the 2019 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Sof

View full text Add to dashboard Cite

Relational model finding is a successful technique which has been used in a wide range of problems during the last decade. This success is partly due to the fact that many problems contain relational structures which can be explored using relational model finders. Although these model finders allow for the exploration of such structures they often struggle with incorporating the non-relational elements. In this paper we introduce AlleAlle, a method and language that integrates reasoning on both relational structure and non-relational elements-the data-of a problem. By combining first order logic with Codd's relational algebra, transitive closure, and optimization criteria, we obtain a rich input language for expressing constraints on both relational and scalar values. We present the semantics of AlleAlle and the translation of AlleAlle specifications to SMT constraints, and use the off-the-shelf SMT solver Z3 to find solutions. We evaluate AlleAlle by comparing its performance with Kodkod, a state-of-the-art relational model finder, and by encoding a solution to the optimal package resolution problem. Initial benchmarking show that although the translation times of AlleAlle can be improved, the resulting SMT constraints can efficiently be solved by the underlying solver. CCS Concepts • Theory of computation → Constraint and logic programming; • Software and its engineering → Specification languages.

show abstract