Chargement en cours…

Theorem Proving in Higher Order Logics 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007, Proceedings /

Détails bibliographiques
Cote:Libro Electrónico
Collectivité auteur: SpringerLink (Online service)
Autres auteurs: Schneider, Klaus (Éditeur intellectuel), Brandt, Jens (Éditeur intellectuel)
Format: Électronique eBook
Langue:Inglés
Publié: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Édition:1st ed. 2007.
Collection:Theoretical Computer Science and General Issues, 4732
Sujets:
Accès en ligne:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-74591-4
003 DE-He213
005 20230222032210.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540745914  |9 978-3-540-74591-4 
024 7 |a 10.1007/978-3-540-74591-4  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Theorem Proving in Higher Order Logics  |h [electronic resource] :  |b 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007, Proceedings /  |c edited by Klaus Schneider, Jens Brandt. 
250 |a 1st ed. 2007. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2007. 
300 |a VIII, 404 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 4732 
505 0 |a On the Utility of Formal Methods in the Development and Certification of Software -- Formal Techniques in Software Engineering: Correct Software and Safe Systems -- Separation Logic for Small-Step cminor -- Formalising Java's Data Race Free Guarantee -- Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL -- Formalising Generalised Substitutions -- Extracting Purely Functional Contents from Logical Inductive Types -- A Modular Formalisation of Finite Group Theory -- Verifying Nonlinear Real Formulas Via Sums of Squares -- Verification of Expectation Properties for Discrete Random Variables in HOL -- A Formally Verified Prover for the Description Logic -- Proof Pearl: The Termination Analysis of Terminator -- Improving the Usability of HOL Through Controlled Automation Tactics -- Verified Decision Procedures on Context-Free Grammars -- Using XCAP to Certify Realistic Systems Code: Machine Context Management -- Proof Pearl: De Bruijn Terms Really Do Work -- Proof Pearl: Looping Around the Orbit -- Source-Level Proof Reconstruction for Interactive Theorem Proving -- Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF -- Automatically Translating Type and Function Definitions from HOL to ACL2 -- Operational Reasoning for Concurrent Caml Programs and Weak Memory Models -- Proof Pearl: Wellfounded Induction on the Ordinals Up to ? 0 -- A Monad-Based Modeling and Verification Toolbox with Application to Security Protocols -- Primality Proving with Elliptic Curves -- HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism -- Building Formal Method Tools in the Isabelle/Isar Framework -- Simple Types in Type Theory: Deep and Shallow Encodings -- Mizar's Soft Type System. 
650 0 |a Computer science. 
650 0 |a Machine theory. 
650 0 |a Software engineering. 
650 0 |a Artificial intelligence. 
650 0 |a Logic design. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Formal Languages and Automata Theory. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Software Engineering. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Logic Design. 
700 1 |a Schneider, Klaus.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Brandt, Jens.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540843139 
776 0 8 |i Printed edition:  |z 9783540745907 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 4732 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-74591-4  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)