000 04878nam a22006135i 4500
001 978-3-540-31820-0
003 DE-He213
005 20240730194152.0
007 cr nn 008mamaa
008 100720s2005 gw | s |||| 0|eng d
020 _a9783540318200
_9978-3-540-31820-0
024 7 _a10.1007/11541868
_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 _aTheorem Proving in Higher Order Logics
_h[electronic resource] :
_b18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings /
_cedited by Joe Hurd, Tom Melham.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aX, 414 p.
_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 ;
_v3603
505 0 _aInvited Papers -- On the Correctness of Operating System Kernels -- Alpha-Structural Recursion and Induction -- Regular Papers -- Shallow Lazy Proofs -- Mechanized Metatheory for the Masses: The PoplMark Challenge -- A Structured Set of Higher-Order Problems -- Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS -- Proving Equalities in a Commutative Ring Done Right in Coq -- A HOL Theory of Euclidean Space -- A Design Structure for Higher Order Quotients -- Axiomatic Constructor Classes in Isabelle/HOLCF -- Meta Reasoning in ACL2 -- Reasoning About Java Programs with Aliasing and Frame Conditions -- Real Number Calculations and Theorem Proving -- Verifying a Secure Information Flow Analyzer -- Proving Bounds for Real Linear Programs in Isabelle/HOL -- Essential Incompleteness of Arithmetic Verified by Coq -- Verification of BDD Normalization -- Extensionality in the Calculus of Constructions -- A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic -- A Generic Network on Chip Model -- Formal Verification of a SHA-1 Circuit Core Using ACL2 -- From PSL to LTL: A Formal Validation in HOL -- Proof Pearls -- Proof Pearl: A Formal Proof of Higman's Lemma in ACL2 -- Proof Pearl: Dijkstra's Shortest Path Algorithm Verified with ACL2 -- Proof Pearl: Defining Functions over Finite Sets -- Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof.
520 _aThis volume constitutes the proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005), which was held during22-25August2005inOxford,UK.TPHOLscoversallaspectsoftheorem proving in higher order logics as well as related topics in theorem proving and veri?cation. There were 49 papers submitted to TPHOLs 2005 in the full research c- egory, each of which was refereed by at least three reviewers selected by the programcommittee. Of these submissions, 20 researchpapersand 4 proof pearls were accepted for presentation at the conference and publication in this volume. In keeping with longstanding tradition, TPHOLs 2005 also o?ered a venue for the presentation of work in progress, where researchers invited discussion by means of a brief introductory talk and then discussed their work at a poster session. A supplementary proceedings volume was published as a 2005 technical report of the Oxford University Computing Laboratory. The organizers are grateful to Wolfgang Paul and Andrew Pitts for agreeing to give invited talks at TPHOLs 2005.
650 0 _aComputer science.
_99832
650 0 _aComputer systems.
_9156001
650 0 _aMachine theory.
_9156002
650 0 _aSoftware engineering.
_94138
650 0 _aArtificial intelligence.
_93407
650 1 4 _aTheory of Computation.
_9156003
650 2 4 _aComputer System Implementation.
_938514
650 2 4 _aFormal Languages and Automata Theory.
_9156004
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aArtificial Intelligence.
_93407
700 1 _aHurd, Joe.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156005
700 1 _aMelham, Tom.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9156006
710 2 _aSpringerLink (Online service)
_9156007
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540283720
776 0 8 _iPrinted edition:
_z9783540814450
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3603
_9156008
856 4 0 _uhttps://doi.org/10.1007/11541868
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95062
_d95062