Normal view MARC view ISBD view

Interactive Theorem Proving [electronic resource] : Second International Conference, ITP 2011, Berg en Dal, The Netherlands, August 22-25, 2011. Proceedings / edited by Marko Eekelen, Herman Geuvers, Julien Schmaltz, Freek Wiedijk.

By: Eekelen, Marko [editor.].
Contributor(s): Geuvers, Herman [editor.] | Schmaltz, Julien [editor.] | Wiedijk, Freek [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 6898Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XI, 383 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642228636.Subject(s): Computer science | Software engineering | Logic design | Artificial intelligence | Computer Science | Logics and Meanings of Programs | Software Engineering | Mathematical Logic and Formal Languages | Programming Languages, Compilers, Interpreters | Artificial Intelligence (incl. Robotics) | Programming TechniquesDDC classification: 005.1015113 Online resources: Click here to access online In: Springer eBooksSummary: This book constitutes the refereed proceedings of the Second International Conference on Interactive Theorem proving, ITP 2011, held in Berg en Dal, The Netherlands, in August 2011. The 25 revised full papers presented were carefully reviewed and selected from 50 submissions. Among the topics covered are counterexample generation, verification, validation, term rewriting, theorem proving, computability theory, translations from one formalism to another, and cooperation between tools. Several verification case studies were presented, with applications to computational geometry, unification, real analysis, etc.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

This book constitutes the refereed proceedings of the Second International Conference on Interactive Theorem proving, ITP 2011, held in Berg en Dal, The Netherlands, in August 2011. The 25 revised full papers presented were carefully reviewed and selected from 50 submissions. Among the topics covered are counterexample generation, verification, validation, term rewriting, theorem proving, computability theory, translations from one formalism to another, and cooperation between tools. Several verification case studies were presented, with applications to computational geometry, unification, real analysis, etc.

There are no comments for this item.

Log in to your account to post a comment.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue