Interactive Theorem Proving [electronic resource] : Second International Conference, ITP 2011, Berg en Dal, The Netherlands, August 22-25, 2011, Proceedings / edited by Marko Van Eekelen, Herman Geuvers, Julien Schmaltz, Freek Wiedijk.
Contributor(s): Van Eekelen, Marko [editor.]
| Geuvers, Herman [editor.] | Schmaltz, Julien [editor.] | Wiedijk, Freek [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 6898Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: XI, 383 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642228636.Subject(s): Computer science | Software engineering | Machine theory | Compilers (Computer programs) | Artificial intelligence | Computer programming | Computer Science Logic and Foundations of Programming | Software Engineering | Formal Languages and Automata Theory | Compilers and Interpreters | Artificial Intelligence | Programming TechniquesAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.