Cantitate/Preț
Produs
Total produse
Vezi coșul
Interactive Theorem Proving de Christian Urban

Interactive Theorem Proving: Lecture Notes in Computer Science, cartea 9236

Editat de Christian Urban, Xingyuan Zhang
en Limba Engleză Paperback – 27 aug 2015
This book constitutes the proceedings of the 6th International Conference on Interactive Theorem Proving, ITP 2015, held in Nanjing, China, in August 2015. The 27 papers presented in this volume were carefully reviewed and selected from 54 submissions. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization of mathematics.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33159 lei

Preț vechi: 41449 lei
-20%

Puncte Express: 497

Carte tipărită la comandă

Livrare economică 08-22 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319221014
ISBN-10: 3319221019
Pagini: 484
Ilustrații: XI, 469 p. 63 illus.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1st edition 2015
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Verified, Practical Upper Bounds for State Space Diameters.- Formalization of Error-correcting Codes: from Hamming to Modern Coding Theory.- ROSCoq: Robots powered by Constructive Reals.- Asynchronous processing of Coq documents: from the kernel up to the user interface.- A Concrete Memory Model for CompCert.- Validating Dominator Trees for a Fast, Verified Dominance Test.- Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra.- Mechanisation of AKS Algorithm.- Machine-Checked Verification of the Correctness and Amortized.- Improved Tool Support for Machine-Code Decompilation in HOL4.- A Formalized Hierarchy of Probabilistic System Types.- Learning To Parse on Aligned Corpora.- A Consistent Foundation for Isabelle/HOL.- Foundational Property-Based Testing.- A First-Order Functional Intermediate Language for Verified Compilers.- Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions.- ModuRes: a Coq Library for Modular Reasoning about Concurrent.- Higher-Order Imperative Programming Languages.- Transfinite Constructions in Classical Type Theory.- A Mechanized Theory of regular trees in dependent type theory.- Deriving Comparators and Show-Functions in Isabelle/HOL.- Formalizing Knot Theory in Isabelle/HOL.- Pattern Matches in HOL: A New Representation and Improved Code Generation.