Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5674)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): TPHOLs: International Conference on Theorem Proving in Higher Order Logics
Conference proceedings info: TPHOLs 2009.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (34 papers)
-
Front Matter
-
Regular Papers
About this book
Keywords
- Agda
- Coq
- HOL
- MIZAR
- automata theory
- calculus
- first-order logic
- formal verification
- higher-order logic
- logic
- memory model
- model checking
- second-order logic
- security protocols
- verification
- algorithm analysis and problem complexity
Editors and Affiliations
-
Institut für Informatik, Technische Universität München, Garching, Germany
Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel
Bibliographic Information
Book Title: Theorem Proving in Higher Order Logics
Book Subtitle: 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009, Proceedings
Editors: Stefan Berghofer, Tobias Nipkow, Christian Urban, Makarius Wenzel
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-03359-9
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2009
Softcover ISBN: 978-3-642-03358-2Published: 04 August 2009
eBook ISBN: 978-3-642-03359-9Published: 20 August 2009
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 517
Topics: Theory of Computation, Formal Languages and Automata Theory, Computer Science Logic and Foundations of Programming, Mathematics of Computing, Discrete Mathematics in Computer Science, Algorithms