Theorem Proving in Higher Order Logics (Record no. 37951)

000 -LEADER
fixed length control field 04649nam a22005895i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783642033599
-- 978-3-642-03359-9
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.131
245 10 - TITLE STATEMENT
Title Theorem Proving in Higher Order Logics
Sub Title 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings /
Statement of responsibility, etc edited by Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 2009.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XI, 517 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Papers -- Let’s Get Physical: Models and Methods for Real-World Security Protocols -- VCC: A Practical System for Verifying Concurrent C -- Without Loss of Generality -- Invited Tutorials -- HOL Light: An Overview -- A Brief Overview of Mizar -- A Brief Overview of Agda – A Functional Language with Dependent Types -- The Twelf Proof Assistant -- Regular Papers -- Hints in Unification -- Psi-calculi in Isabelle -- Some Domain Theory and Denotational Semantics in Coq -- Turning Inductive into Equational Specifications -- Formalizing the Logic-Automaton Connection -- Extended First-Order Logic -- Formalising Observer Theory for Environment-Sensitive Bisimulation -- Formal Certification of a Resource-Aware Language Implementation -- A Certified Data Race Analysis for a Java-like Language -- Formal Analysis of Optical Waveguides in HOL -- The HOL-Omega Logic -- A Purely Definitional Universal Domain -- Types, Maps and Separation Logic -- Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence -- Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL -- Packaging Mathematical Structures -- Practical Tactics for Separation Logic -- Verified LISP Implementations on ARM, x86 and PowerPC -- Trace-Based Coinductive Operational Semantics for While -- A Better x86 Memory Model: x86-TSO -- Formal Verification of Exact Computations Using Newton’s Method -- Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL -- A Hoare Logic for the State Monad -- Certification of Termination Proofs Using CeTA -- A Formalisation of Smallfoot in HOL -- Liveness Reasoning with Isabelle/HOL -- Mind the Gap.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics, TPHOLs 200, held in Munich, Germany, in August 2009. The 26 revised full papers presented together with 1 proof pearl, 4 tool presentations, and 3 invited papers were carefully reviewed and selected from 55 submissions. The papers cover all aspects of theorem proving in higher order logics as well as related topics in theorem proving and verification such as formal semantics of specification, modeling, and programming languages, specification and verification of hardware and software, formalization of mathematical theories, advances in theorem prover technology, as well as industrial application of theorem provers.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logic design.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computational complexity.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematical Logic and Formal Languages.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Logics and Meanings of Programs.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Mathematics of Computing.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Models and Principles.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Berghofer, Stefan.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Nipkow, Tobias.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Urban, Christian.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Wenzel, Makarius.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-3-642-03359-9
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2009.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK8657 http://dx.doi.org/10.1007/978-3-642-03359-9 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha