TY  - BOOK
AU  - Beckert,Bernhard
AU  - Hähnle,Reiner
AU  - Schmitt,P.H.
TI  - Verification of object-oriented software: the KeY approach 
T2  - Lecture notes in computer science,
SN  - 9783540690610
AV  - QA76.76.V47 V474 2007eb
U1  - 005.1/4 22
PY  - 2007///
CY  - Berlin, New York
PB  - Springer
KW  - Computer software
KW  - Verification
KW  - Object-oriented methods (Computer science)
KW  - Java (Computer program language)
KW  - Computer programs
KW  - Logiciels
KW  - Vérification
KW  - Conception orientée objet (Informatique)
KW  - Java (Langage de programmation)
KW  - cct
KW  - Informatique
KW  - eclas
KW  - fast
KW  - wiskunde
KW  - mathematics
KW  - computerwetenschappen
KW  - computer sciences
KW  - kunstmatige intelligentie
KW  - artificial intelligence
KW  - logica
KW  - logic
KW  - programmeertalen
KW  - programming languages
KW  - software engineering
KW  - Information and Communication Technology (General)
KW  - Informatie- en communicatietechnologie (algemeen)
N1  - Includes bibliographical references (pages 627-643) and index; A New Look at Formal Methods for Software Construction -- A New Look at Formal Methods for Software Construction -- I: Foundations -- First-Order Logic -- Dynamic Logic -- Construction of Proofs -- II: Expressing and Formalising Requirements -- Formal Specification -- Pattern-Driven Formal Specification -- Natural Language Specifications -- Proof Obligations -- From Sequential Java to Java Card -- III: Using the KeY System -- Using KeY -- Proving by Induction -- Java Integers -- Proof Reuse -- IV: Case Studies -- The Demoney Case Study -- The Schorr-Waite-Algorithm -- Appendices -- Predefined Operators in Java Card DL -- The KeY Syntax
N2  - Long gone are the days when program veri?cation was a task carried out merely by hand with paper and pen. For one, we are increasingly interested in proving actual program artifacts, not just abstractions thereof or core algorithms. The programs we want to verify today are thus longer, including whole classes and modules. As we consider larger programs, the number of cases to be considered in a proof increases. The creative and insightful parts of a proof can easily be lost in scores of mundane cases. Another problem with paper-and-pen proofs is that the features of the programming languages we employ in these programs are plentiful, including object-oriented organizations of data, facilities for specifying di?erent c- trol?ow for rare situations, constructs for iterating over the elements of a collection, and the grouping together of operations into atomic transactions. These language features were designed to facilitate simpler and more natural encodings of programs, and ideally they are accompanied by simpler proof rules. But the variety and increased number of these features make it harder to remember all that needs to be proved about their uses. As a third problem, we have come to expect a higher degree of rigor from our proofs. A proof carried out or replayed by a machine somehow gets more credibility than one that requires human intellect to understand
UR  - https://link.springer.com/10.1007/978-3-540-69061-0
ER  -