Verification Object Oriented Software Key (10 results)

2007th ed. 15 x 23 cm. 687 pages. Paperback. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Englisch.

Condition: New. In English.

Condition: New. pp. 694.

Taschenbuch. Condition: Neu. 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.…

Taschenbuch. Condition: Neu. Verification of Object-Oriented Software. The KeY Approach | Foreword by K. Rustan M. Leino | Bernhard Beckert (u. a.) | Taschenbuch | xxix | Englisch | 2007 | Springer | EAN 9783540689775 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Paperback. Condition: Brand New. 1st edition. 658 pages. 9.00x6.00x1.00 inches. In Stock.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The ultimate goal of program verification is not the theory behind the tools or the tools themselves, but the application of the theory and tools in the software engineering process. Our society relies on the correctness of a vast and growing amount of software. Improving the software engineering process is an important, long-term goal with many steps. Two of those steps are the KeY tool and this KeY book. 692 pp. Englisch.…

Condition: New. Print on Demand pp. 694 Illus.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 692 pp. Englisch.…

Condition: New. PRINT ON DEMAND pp. 694.