Title of article :
How the design of JML accommodates both runtime assertion checking and formal verification
Author/Authors :
Gary T. Leavens، نويسنده , , Yoonsik Cheon and Ashaveena Perumandla ، نويسنده , , Curtis Clifton، نويسنده , , Clyde Ruby، نويسنده , , David R. Cok، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2005
Pages :
24
From page :
185
To page :
208
Abstract :
Specifications that are used in detailed design and in the documentation of existing code are primarily written and read by programmers. However, most formal specification languages either make heavy use of symbolic mathematical operators, which discourages use by programmers, or limit assertions to expressions of the underlying programming language, which makes it difficult to write exact specifications. Moreover, using assertions that are expressions in the underlying programming language can cause problems both in runtime assertion checking and in formal verification, because such expressions can potentially contain side effects. The Java Modeling Language, JML, avoids these problems. It uses a side-effect free subset of Java’s expressions to which are added a few mathematical operators (such as the quantifiers ⧹forall and ⧹exists). JML also hides mathematical abstractions, such as sets and sequences, within a library of Java classes. The goal is to allow JML to serve as a common notation for both formal verification and runtime assertion checking; this gives users the benefit of several tools without the cost of changing notations.
Keywords :
Specification languages , Runtime assertion checking , Formal Methods , Program verification , Java language , JML language , Programming by contract
Journal title :
Science of Computer Programming
Serial Year :
2005
Journal title :
Science of Computer Programming
Record number :
1079771
Link To Document :
بازگشت