Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
34
views
0
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,573
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Interactive Theorem Proving
other
Editor(s):
Lennart Beringer
,
Amy Felty
Publication date
(Print):
2012
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Online interactive cancer simulations and demos
Author and book information
Book
ISBN (Print):
978-3-642-32346-1
ISBN (Electronic):
978-3-642-32347-8
Publication date (Print):
2012
DOI:
10.1007/978-3-642-32347-8
SO-VID:
d544094f-1791-45d5-ace0-324914306fe6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
MetiTarski: Past and Future
pp. 233
Formalization of Shannon’s Theorems in SSReflect-Coq
pp. 345
More SPASS with Isabelle
pp. 83
A Refinement-Based Approach to Computational Algebra in Coq
pp. 99
Bridging the Gap: Automatic Verified Abstraction of C
pp. 166
Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm
Similar content
1,573
Static semantic analysis and theorem proving for CASL
Authors:
Till Mossakowski
,
Kolyang
,
Bernd Krieg-Brückner
CardioMEMS: Proving that Failure is not the only option for HF patients
Authors:
Carolyn Nissley
,
Justin D. Roberts
,
Lisa D. Rathman
…
Proving properties of a ring of finite-state machines
Authors:
Ichiro Suzuki
See all similar