The VLISP project showed how to produce a comprehensively verified implemen tation for a programming language, namely Scheme [4, 15). Some of the major elements in this verification were: • The proof was based on the Clinger-Rees denotational semantics of Scheme given in [15). Our goal was to produce a "warts-and-all" verification of a real language. With very few exceptions, we constrained ourselves to use the se mantic specification as published. The verification was intended to be rigorous, but. not. complet.ely formal, much in the style of ordinary mathematical discourse. Our goal was to verify the algorithms and data types used in the implementat.ion, not their embodiment. in code. See Section 2 for a more complete discussion ofthese issues. Our decision to be faithful to the published semantic specification led to the most difficult portions ofthe proofs; these are discussed in [13, Section 2.3-2.4). • Our implementation was based on the Scheme48 implementation of Kelsey and Rees [17). This implementation t.ranslates Scheme into an intermediate-level "byte code" language, which is interpreted by a virtual machine. The virtual machine is written in a subset of Scheme called PreScheme. The implementationissufficient.ly complete and efficient to allow it to bootstrap itself. We believe that this is the first. verified language implementation with these properties.
"Sinopsis" puede pertenecer a otra edición de este libro.
The VLISP project showed how to produce a comprehensively verified implemen tation for a programming language, namely Scheme [4, 15). Some of the major elements in this verification were: · The proof was based on the Clinger-Rees denotational semantics of Scheme given in [15). Our goal was to produce a "warts-and-all" verification of a real language. With very few exceptions, we constrained ourselves to use the se mantic specification as published. The verification was intended to be rigorous, but. not. complet.ely formal, much in the style of ordinary mathematical discourse. Our goal was to verify the algorithms and data types used in the implementat.ion, not their embodiment. in code. See Section 2 for a more complete discussion ofthese issues. Our decision to be faithful to the published semantic specification led to the most difficult portions ofthe proofs; these are discussed in [13, Section 2.3-2.4). · Our implementation was based on the Scheme48 implementation of Kelsey and Rees [17). This implementation t.ranslates Scheme into an intermediate-level "byte code" language, which is interpreted by a virtual machine. The virtual machine is written in a subset of Scheme called PreScheme. The implementationissufficient.ly complete and efficient to allow it to bootstrap itself. We believe that this is the first. verified language implementation with these properties.
The VLISP project undertook to provide a rigorous verification of a programming language. The project began at the MITRE Corporation in late 1989 under the company's Technology Program. The work was supervised by the Rome Laboratory of the U.S. Air Force. Northeastern University became involved a year later.
The aim was to show realism and comprehensiveness. Realism is revealed in the choice of a widely used programming language, Scheme, and the choice of a flexible and reasonably efficient implementation strategy. Comprehensiveness is revealed in the broad range of steps undertaken in verification, leading from the abstract syntax of a high level programming language, equipped with a continuation style, denotational semantics, down to an abstract assembly language equipped with a concrete operational semantics.
The editors of VLISP have extracted re-usable conclusions from the work at two, quite different levels. First general approaches to the organization of the work have been found which are beneficial and which can be recommended. They help to make formal methods more pragmatically effective. Second, there are four main verification techniques that are applied in the proof process. This relatively small collection of techniques, none of them particularly arcane, allow a large verification to be undertaken. The identification of such re-usable parts bodes well for the increased use of formal methods in compiler construction.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 28,98 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoEUR 5,20 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoLibrería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9780792395669_new
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Gebunden. Condición: New. Nº de ref. del artículo: 458443739
Cantidad disponible: Más de 20 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190186013
Cantidad disponible: Más de 20 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
Hardcover. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA75407923956625
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: Neu. Neuware - The VLISP project showed how to produce a comprehensively verified implemen tation for a programming language, namely Scheme [4, 15). Some of the major elements in this verification were: - The proof was based on the Clinger-Rees denotational semantics of Scheme given in [15). Our goal was to produce a 'warts-and-all' verification of a real language. With very few exceptions, we constrained ourselves to use the se mantic specification as published. The verification was intended to be rigorous, but. not. complet.ely formal, much in the style of ordinary mathematical discourse. Our goal was to verify the algorithms and data types used in the implementat.ion, not their embodiment. in code. See Section 2 for a more complete discussion ofthese issues. Our decision to be faithful to the published semantic specification led to the most difficult portions ofthe proofs; these are discussed in [13, Section 2.3-2.4). - Our implementation was based on the Scheme48 implementation of Kelsey and Rees [17). This implementation t.ranslates Scheme into an intermediate-level 'byte code' language, which is interpreted by a virtual machine. The virtual machine is written in a subset of Scheme called PreScheme. The implementationissufficient.ly complete and efficient to allow it to bootstrap itself. We believe that this is the first. verified language implementation with these properties. Nº de ref. del artículo: 9780792395669
Cantidad disponible: 2 disponibles