Verification of Object-Oriented Software. The KeY Approach : Foreword by K. Rustan M. Leino

Bernhard Beckert

ISBN 10: 354068977X / ISBN 13: 9783540689775

Edité par Springer Berlin Heidelberg, 2007

A propos de cet article

Druck auf Anfrage Neuware - Printed after ordering - 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.

N° de réf. du vendeur 9783540689775

Détails bibliographiques

• Titre: Verification of Object-Oriented Software. The KeY Approach : Foreword by K. Rustan M. Leino
• Éditeur: Springer Berlin Heidelberg
• Date de parution: 2007
• Langue: anglais
• ISBN à 10 chiffres: 354068977X
• ISBN à 13 chiffres: 9783540689775
• Reliure: Taschenbuch
• État de l'article: Neu
• Dimensions: 235 L x 155 H x 37 P (en millimètres) 235 millimètres de largeur par 155 millimètres de hauteur par 37 millimètres de profondeur
• Poids: 1031 grammes

A propos de ce titre

Synopsis

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.