2003 · 17 citations · 4 references
ComputingComputer ScienceFormal MethodsProgramming LanguagesSet TheoryDeductive VerificationModel CheckingSpecification LanguagesTheorem ProvingVerificationCorrectness CheckingCorrectness ProofsInvariant-based VerificationProgram CorrectnessProgram Verification
We propose an extension of the design-by-contract approach. In addition to preconditions, postconditions, and invariants as the basis for proving properties of a program, information is also provided on which parts of the state are not changed by running the program. This is done in the form of modifier sets. We present a precise semantics of modifier sets and theorems on how to use them in program-correctness proofs. This technique has been implemented as part of the KeY system.
4
Gary T. Leavens, Albert L. Baker, Clyde Ruby · ACM SIGSOFT Software Engineering Notes · 2006 · 787 citations
Wolfgang Ahrendt, Thomas Baar, Bernhard Beckert et al. · Software & Systems Modeling · 2004 · 261 citations · Full text
JML: notations and tools supporting detailed design in Java
Gary T. Leavens, Clyde Ruby, K. Rustan et al. · 2000 · 126 citations