The Approach: Integrating Object Oriented Design and Formal Verification

Ahrendt, Wolfgang; Baar, Thomas; Beckert, Bernhard; Giese, Martin; Habermalz, Elmar; Hähnle, Reiner; Menzel, W. Paul; Schmitt, Peter H.

doi:10.1007/3-540-40006-0_3

Cited by 42 publications

(27 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For our authoring tool to be practically useful, it must be tightly integrated with mainstream software development tools. In the KeY project [1] a design methodology plus CASE-tool is developed that allows seamless integration of object-oriented modeling (OOM) with program development, generation of formal specifications, as well as formal verification of code and specifications. The KeY development system is based on a commercial UML-CASE tool for OOM.…”

Section: Future Workmentioning

confidence: 99%

An Authoring Tool for Informal and Formal Requirements Specifications

Hähnle

Johannisson

Ranta

2002

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. We describe foundations and design principles of a tool that supports authoring of informal and formal software requirements specifications simultaneously and from a single source. The tool is an attempt to bridge the gap between completely informal requirements specifications (as found in practice) and formal ones (as needed in formal methods). The user is supported by an interactive syntax-directed editor, parsers and linearizers. As a formal specification language we realize the Object Constraint Language, a substandard of the UML, on the informal side a fragment of English. The implementation is based on the Grammatical Framework, a generic tool that combines linguistic and logical methods.

show abstract

Section: Future Workmentioning

confidence: 99%

An Authoring Tool for Informal and Formal Requirements Specifications

Hähnle

Johannisson

Ranta

2002

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…Systems based on verification-condition generation and theorem proving include the program verifier [39], the interactive program verifier [17], the Stanford Pascal Verifier [74,60], the Gypsy environment [28], Larch [30], ESC/Modula-3 [16], ESC/Java [22], ESC/Java2 [12], Boogie [6], Krakatoa [55], KeY [3], as well as more general frameworks such as ACL2 [38,59], and STeP [8], and PVS [64]. Traditionally, these systems are based on verification condition generation combined with theorem provers.…”

Section: Verification Systems With Modular Reasoningmentioning

confidence: 99%

An overview of the Jahob analysis system: project goals and current status

Kuncak¹,

Rinard²

2006

Proceedings 20th IEEE International Parallel &Amp; Distributed Processing Symposium

View full text Add to dashboard Cite

We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formulas in a subset of Isabelle as the specification language. It uses monadic second-order logic over trees to reason about reachability in linked data structures, the Isabelle theorem prover and Nelson-Oppen style theorem provers to reason about high-level properties and arrays, and a new technique to combine reasoning about constraints on uninterpreted function symbols with other decision procedures. It also incorporates new decision procedures for reasoning about sets with cardinality constraints. The system can infer loop invariants using new symbolic shape analysis. Initial results in the use of our system are promising; we are continuing to develop and evaluate it.

show abstract

“…The work reported in this paper has been carried out as part of the KeY project. The goal of this project is to develop a tool supporting formal specification and verification of Java Card programs within a commercial platform for UML based software development, see [1,2] for details.…”

Section: Related Workmentioning

confidence: 99%

An Improved Rule for While Loops in Deductive Program Verification

Beckert

Schlager

Schmitt

2005

Formal Methods and Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. The performance and usability of deductive program verification systems can be greatly enhanced if specifications of programs and program parts not only consist of the usual pre-/post-condition pairs and invariants but also include additional information on which memory locations are changed by executing a program. This allows to separate the aspects of (a) which locations change and (b) how they change, state the change information in a compact way, and make the proof process more efficient. In this paper, we extend this idea from method specifications to loop invariants; and we define a proof rule for while loops that makes use of the change information associated with the loop body. It has been implemented and is successfully used in the KeY software verification system.

show abstract

The Approach: Integrating Object Oriented Design and Formal Verification

Cited by 42 publications

References 13 publications

An Authoring Tool for Informal and Formal Requirements Specifications

An Authoring Tool for Informal and Formal Requirements Specifications

An overview of the Jahob analysis system: project goals and current status

An Improved Rule for While Loops in Deductive Program Verification

Contact Info

Product

Resources

About