000 04067nam a22006255i 4500
001 978-3-642-35308-6
003 DE-He213
005 20240423130020.0
007 cr nn 008mamaa
008 121116s2012 gw | s |||| 0|eng d
020 _a9783642353086
_9978-3-642-35308-6
024 7 _a10.1007/978-3-642-35308-6
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aCertified Programs and Proofs
_h[electronic resource] :
_bSecond International Conference, CPP 2012, Kyoto, Japan, December 13-15, 2012, Proceedings /
_cedited by Chris Hawblitzel, Dale Miller.
250 _a1st ed. 2012.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2012.
300 _aX, 305 p. 64 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7679
505 0 _aScalable 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.
520 _aThis 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 computer science and mathematics in which certification via formal techniques is crucial.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aCompilers (Computer programs).
650 0 _aComputer science
_xMathematics.
650 0 _aSoftware engineering.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aSoftware Engineering.
650 2 4 _aArtificial Intelligence.
700 1 _aHawblitzel, Chris.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMiller, Dale.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642353079
776 0 8 _iPrinted edition:
_z9783642353093
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v7679
856 4 0 _uhttps://doi.org/10.1007/978-3-642-35308-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c184126
_d184126