My Account Log in

1 option

Theorem Proving in Higher Order Logics : 16th International Conference, TPHOLs 2003, Rom, Italy, September 8-12, 2003, Proceedings / edited by David Basin, Burkhart Wolff.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Basin, David, editor.
Wolff, Burkhart, 1962- editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2758.
Lecture Notes in Computer Science, 0302-9743 ; 2758
Language:
English
Subjects (All):
Philosophy.
Logic, Symbolic and mathematical.
Logic design.
Software engineering.
Computer logic.
Artificial intelligence.
Philosophy, general.
Mathematical Logic and Formal Languages.
Logic Design.
Software Engineering.
Logics and Meanings of Programs.
Artificial Intelligence.
Local Subjects:
Philosophy, general.
Mathematical Logic and Formal Languages.
Logic Design.
Software Engineering.
Logics and Meanings of Programs.
Artificial Intelligence.
Physical Description:
1 online resource (X, 366 pages).
Edition:
First edition 2003.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
System Details:
text file PDF
Summary:
This volume constitutes the proceedings of the16th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2003) held September 8-12, 2003 in Rome, Italy. TPHOLs covers all aspects of theorem proving in higher order logics as well as related topics in theorem proving and veri?cation. TPHOLs 2003 was co-located with TABLEAUX, the International Con- rence on Automated Reasoning with Analytic Tableaux and Related Methods, and with Calculemus, the Symposium on the Integration of Symbolic Compu- tion and Mechanized Reasoning. There were 50 papers submitted to TPHOLs in the full research category, each of which was refereed by at least 3 reviewers, selected by the program c- mittee.Ofthesesubmissions,21wereacceptedforpresentationattheconference and publication in this volume. In keeping with tradition, TPHOLs 2003 also o?ered a venue for the presentation of work in progress, where researchers - vite discussion by means of a brief preliminary talk and then discuss their work at a poster session. A supplementary proceedings containing associated papers for work in progress was published by the computer science department at the Universit ̈ at Freiburg. The organizers are grateful to Jean-Raymond Abrial, Patrick Lincoln, and Dale Miller for agreeing to give invited talks at TPHOLs 2003. The TPHOLs conference traditionally changes continent each year in order to maximize the chances that researchers from around the world can attend.
Contents:
Invited Talk I
Click'n Prove: Interactive Proofs within Set Theory
Hardware and Assembler Languages
Formal Specification and Verification of ARM6
A Programming Logic for Java Bytecode Programs
Verified Bytecode Subroutines
Proof Automation I
Complete Integer Decision Procedures as Derived Rules in HOL
Changing Data Representation within the Coq System
Applications of Polytypism in Theorem Proving
Proof Automation II
A Coverage Checking Algorithm for LF
Automatic Generation of Generalization Lemmas for Proving Properties of Tail-Recursive Definitions
Tool Combination
Embedding of Systems of Affine Recurrence Equations in Coq
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
Combining Testing and Proving in Dependent Type Theory
Invited Talk II
Reasoning about Proof Search Specifications: An Abstract
Logic Extensions
Program Extraction from Large Proof Developments
First Order Logic with Domain Conditions
Extending Higher-Order Unification to Support Proof Irrelevance
Advances in Theorem Prover Technology
Inductive Invariants for Nested Recursion
Implementing Modules in the Coq System
MetaPRL - A Modular Logical Environment
Mathematical Theories
Proving Pearl: Knuth's Algorithm for Prime Numbers
Formalizing Hilbert's Grundlagen in Isabelle/Isar
Security
Using Coq to Verify Java CardTM Applet Isolation Properties
Verifying Second-Level Security Protocols.
Other Format:
Printed edition:
ISBN:
978-3-540-45130-3
9783540451303
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account