Program Logics Certified Compilers by Appel Andrew (19 results)

Condition: New.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: new. Hardcover. Separation logic is the twenty-first-century variant of Hoare logic that permits verification of pointer-manipulating programs. This book covers practical and theoretical aspects of separation logic at a level accessible to beginning graduate students interested in software verification. On the practical side it offers an introduction to verification in Hoare and separation logics, simple case studies for toy languages, and the Verifiable C program logic for the C programming language. On the theoretical side it presents separation algebras as models of separation logics; step-indexed models of higher-order logical features for higher-order programs; indirection theory for constructing step-indexed separation algebras; tree-shares as models for shared ownership; and the semantic construction (and soundness proof) of Verifiable C. In addition, the book covers several aspects of the CompCert verified C compiler, and its connection to foundationally verified software analysis tools. All constructions and proofs are made rigorous and accessible in the Coq developments of the open-source Verified Software Toolchain. This book covers practical and theoretical separation logic suitable for graduate students. On the practical side, it covers verification in Hoare and separation logics, simple case studies, and the Verifiable C program logic. On the theoretical side, it covers separation algebras, step-indexed models, indirection theory, tree-shares, and the semantic construction of Verifiable C. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Condition: New. In.

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: new. Hardcover. Separation logic is the twenty-first-century variant of Hoare logic that permits verification of pointer-manipulating programs. This book covers practical and theoretical aspects of separation logic at a level accessible to beginning graduate students interested in software verification. On the practical side it offers an introduction to verification in Hoare and separation logics, simple case studies for toy languages, and the Verifiable C program logic for the C programming language. On the theoretical side it presents separation algebras as models of separation logics; step-indexed models of higher-order logical features for higher-order programs; indirection theory for constructing step-indexed separation algebras; tree-shares as models for shared ownership; and the semantic construction (and soundness proof) of Verifiable C. In addition, the book covers several aspects of the CompCert verified C compiler, and its connection to foundationally verified software analysis tools. All constructions and proofs are made rigorous and accessible in the Coq developments of the open-source Verified Software Toolchain. This book covers practical and theoretical separation logic suitable for graduate students. On the practical side, it covers verification in Hoare and separation logics, simple case studies, and the Verifiable C program logic. On the theoretical side, it covers separation algebras, step-indexed models, indirection theory, tree-shares, and the semantic construction of Verifiable C. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Condition: New. pp. 472.

Hardcover. Condition: new. Hardcover. Separation logic is the twenty-first-century variant of Hoare logic that permits verification of pointer-manipulating programs. This book covers practical and theoretical aspects of separation logic at a level accessible to beginning graduate students interested in software verification. On the practical side it offers an introduction to verification in Hoare and separation logics, simple case studies for toy languages, and the Verifiable C program logic for the C programming language. On the theoretical side it presents separation algebras as models of separation logics; step-indexed models of higher-order logical features for higher-order programs; indirection theory for constructing step-indexed separation algebras; tree-shares as models for shared ownership; and the semantic construction (and soundness proof) of Verifiable C. In addition, the book covers several aspects of the CompCert verified C compiler, and its connection to foundationally verified software analysis tools. All constructions and proofs are made rigorous and accessible in the Coq developments of the open-source Verified Software Toolchain. This book covers practical and theoretical separation logic suitable for graduate students. On the practical side, it covers verification in Hoare and separation logics, simple case studies, and the Verifiable C program logic. On the theoretical side, it covers separation algebras, step-indexed models, indirection theory, tree-shares, and the semantic construction of Verifiable C. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks.

Hardcover. Condition: Brand New. 458 pages. 9.25x6.25x1.00 inches. In Stock.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Separation logic is the twenty-first-century variant of Hoare logic that permits verification of pointer-manipulating programs. This book covers practical and theoretical aspects of separation logic at a level accessible to beginning graduate students interested in software verification. On the practical side it offers an introduction to verification in Hoare and separation logics, simple case studies for toy languages, and the Verifiable C program logic for the C programming language. On the theoretical side it presents separation algebras as models of separation logics; step-indexed models of higher-order logical features for higher-order programs; indirection theory for constructing step-indexed separation algebras; tree-shares as models for shared ownership; and the semantic construction (and soundness proof) of Verifiable C. In addition, the book covers several aspects of the CompCert verified C compiler, and its connection to foundationally verified software analysis tools. All constructions and proofs are made rigorous and accessible in the Coq developments of the open-source Verified Software Toolchain.

Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 779.

Hardcover. Condition: Brand New. 458 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand.

Condition: New. Print on Demand pp. 472 52 Illus.

Condition: New. PRINT ON DEMAND pp. 472.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book covers practical and theoretical separation logic suitable for graduate students. On the practical side, it covers verification in Hoare and separation logics, simple case studies, and the Verifiable C program logic. On the theoretical side, it co.