Certified Programs and Proofs : Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings

Certified Programs and Proofs : Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings

This book constitutes the refereed proceedings of the Second International Conference on Certified Programs and Proofs, CPP 2012, held in Kyoto, Japan, in December 2012. The 18 revised regular papers presented were carefully reviewed and selected from 37 submissions. They deal with those topics in c...

Description complète

Détails bibliographiques
Auteurs principaux : Hawblitzel Chris (Directeur de publication), Miller Dale (Directeur de publication)
Format : Livre
Langue : anglais
Titre complet : Certified Programs and Proofs : Second International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012. Proceedings / edited by Chris Hawblitzel, Dale Miller.
Publié : Berlin, Heidelberg : Springer Berlin Heidelberg , 2012
Cham : Springer Nature
Collection : Theoretical computer science and general issues (Online)
Accès en ligne : Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr
Sujets :
Computer Science
Artificial Intelligence (incl. Robotics)
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Symbolic and Algebraic Manipulation
Software Engineering
Artificial Intelligence.
Computer Science Logic and Foundations of Programming
Formal Languages and Automata Theory
Compilers and Interpreters
Actes de congrès
Documents associés : Autre format: Certified Programs and Proofs
Autre format: Certified Programs and Proofs
  • Scalable Formal Machine Models
  • Mechanized Semantics for Compiler Verification
  • Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs
  • Program Certification by Higher-Order Model Checking
  • A Formally-Verified Alias Analysis
  • Mechanized Verification of Computing Dominators for Formalizing Compilers
  • On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor
  • An Executable Semantics for CompCert C
  • Producing Certified Functional Code from Inductive Specifications
  • The New Quickcheck for Isabelle: Random, Exhaustive and Symbolic Testing under One Roof
  • Proving Concurrent Noninterference
  • Noninterference for Operating System Kernels
  • Compositional Verification of a Baby Virtual Memory Manager
  • Shall We Juggle, Coinductively?
  • Proof Pearl: Abella Formalization of -Calculus Cube Property
  • A String of Pearls: Proofs of Fermat s Little Theorem
  • Compact Proof Certificates for Linear Logic
  • Constructive Completeness for Modal Logic with Transitive Closure
  • Rating Disambiguation Errors
  • A Formal Proof of Square Root and Division Elimination in Embedded Programs
  • Coherent and Strongly Discrete Rings in Type Theory
  • Improving Real Analysis in Coq: A User-Friendly Approach to Integrals and Derivatives.