|En la categoría:
¿Quieres vender uno?

Lecture Notes in Computer Science Ser.: Verification of Object-Oriented Software

PT Beauty
(17847)
Registrado como vendedor profesional
USD114,99
Aproximadamente98,49 EUR
Estado:
Nuevo
Respira tranquilidad. Se aceptan devoluciones.
Envío:
Gratis USPS Media MailTM.
Ubicado en: Bellflower, California, Estados Unidos
Entrega:
Entrega prevista entre el vie. 15 ago. y el mar. 19 ago. a 94104
Calculamos el plazo de entrega con un método patentado que combina diversos factores, como la proximidad del comprador a la ubicación del artículo, el servicio de envío seleccionado, el historial de envíos del vendedor y otros datos. Los plazos de entrega pueden variar, especialmente en épocas de mucha actividad.
Devoluciones:
30 días para devoluciones. El comprador paga el envío de la devolución..
Pagos:
    Diners Club

Compra con confianza

Garantía al cliente de eBay
Si no recibes el artículo que has pedido, te devolvemos el dinero. Más informaciónGarantía al cliente de eBay - se abre en una nueva ventana o pestaña
El vendedor asume toda la responsabilidad de este anuncio.
N.º de artículo de eBay:175454175416
Última actualización el 16 ene 2024 21:48:49 H.EspVer todas las actualizacionesVer todas las actualizaciones

Características del artículo

Estado
Nuevo: Libro nuevo, sin usar y sin leer, que está en perfecto estado; incluye todas las páginas sin ...
Subject
Computer Science
ISBN
9783540689775

Acerca de este producto

Product Identifiers

Publisher
Springer Berlin / Heidelberg
ISBN-10
354068977X
ISBN-13
9783540689775
eBay Product ID (ePID)
26038665150

Product Key Features

Number of Pages
Xxix, 658 Pages
Language
English
Publication Name
Verification of Object-Oriented Software : the Key Approach
Subject
Software Development & Engineering / General, Intelligence (Ai) & Semantics, Computer Science, Programming / Object Oriented, Compilers
Publication Year
2007
Type
Textbook
Author
Reiner Hähnle
Subject Area
Computers
Series
Lecture Notes in Computer Science Ser.
Format
Trade Paperback

Dimensions

Item Weight
36.8 Oz
Item Length
9.3 in
Item Width
6.1 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
2006-939067
Dewey Edition
22
Reviews
From the reviews:"This book is a collection of work by different authors on software verification. The context of the book is the key project, which aims to build a verification of the systems based on model checking. The book features the widely used specification languages: object constraint language (OCL) and Java modeling language (JML). … this book is a good resource for graduate students and researchers … ." (S. Balaraman, Computing Reviews, December, 2007), From the reviews: "This book is a collection of work by different authors on software verification. The context of the book is the key project, which aims to build a verification of the systems based on model checking. The book features the widely used specification languages: object constraint language (OCL) and Java modeling language (JML). ... this book is a good resource for graduate students and researchers ... ." (S. Balaraman, Computing Reviews, December, 2007)
Series Volume Number
4334
Number of Volumes
1 vol.
Illustrated
Yes
Dewey Decimal
005.1/4
Table Of Content
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.
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., 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.
LC Classification Number
Q334-342

Descripción del artículo del vendedor

Información de vendedor profesional

Certifico que todas mis actividades de venta cumplirán todas las leyes y reglamentos de la UE.
Acerca de este vendedor

PT Beauty

99,3% de votos positivos47 mil artículos vendidos

Se unió el nov 2013
Registrado como vendedor profesional
Visitar tiendaContactar

Valoraciones detalladas sobre el vendedor

Promedio durante los últimos 12 meses
Descripción precisa
5.0
Gastos de envío razonables
5.0
Rapidez de envío
5.0
Comunicación
5.0

Votos de vendedor (16.308)

Todas las valoraciones
Positivas
Neutras
Negativas