Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9236)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): ITP: International Conference on Interactive Theorem Proving
Conference proceedings info: ITP 2015.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (30 papers)
-
Front Matter
About this book
Keywords
- Coq
- Isabelle/HOL
- automated planning
- bracket polynomial
- embedded systems
- error-correcting codes
- formal methods
- formalization of mathematics
- functional languages
- higher-order languages
- inference rules
- knot theory
- model checking
- program verification
- real-time systems
- rewriting
- theorem proving and SAT solving
- transition systems
- type theory
- validation
Editors and Affiliations
-
Department of Informatics, King's College London, London, United Kingdom
Christian Urban
-
PLA University of Science and Technology, Nanjing, China
Xingyuan Zhang
Bibliographic Information
Book Title: Interactive Theorem Proving
Book Subtitle: 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings
Editors: Christian Urban, Xingyuan Zhang
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-22102-1
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2015
Softcover ISBN: 978-3-319-22101-4Published: 27 August 2015
eBook ISBN: 978-3-319-22102-1Published: 18 August 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 469
Number of Illustrations: 63 b/w illustrations
Topics: Mathematical Logic and Formal Languages, Artificial Intelligence, Logics and Meanings of Programs, Software Engineering, Systems and Data Security, Algorithm Analysis and Problem Complexity