|
|
|
|
LEADER |
03932nmm a2200397 u 4500 |
001 |
EB000375037 |
003 |
EBX01000000000000000228089 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
130626 ||| eng |
020 |
|
|
|a 9783540318200
|
100 |
1 |
|
|a Hurd, Joe
|e [editor]
|
245 |
0 |
0 |
|a Theorem Proving in Higher Order Logics
|h Elektronische Ressource
|b 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings
|c edited by Joe Hurd, Tom Melham
|
250 |
|
|
|a 1st ed. 2005
|
260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2005, 2005
|
300 |
|
|
|a X, 414 p
|b online resource
|
505 |
0 |
|
|a Invited 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
|
653 |
|
|
|a Computer systems
|
653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
653 |
|
|
|a Software engineering
|
653 |
|
|
|a Computer science
|
653 |
|
|
|a Computer System Implementation
|
653 |
|
|
|a Artificial Intelligence
|
653 |
|
|
|a Software Engineering
|
653 |
|
|
|a Formal Languages and Automata Theory
|
653 |
|
|
|a Machine theory
|
653 |
|
|
|a Artificial intelligence
|
653 |
|
|
|a Theory of Computation
|
700 |
1 |
|
|a Melham, Tom
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
028 |
5 |
0 |
|a 10.1007/11541868
|
856 |
4 |
0 |
|u https://doi.org/10.1007/11541868?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 004.0151
|
520 |
|
|
|a This 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
|