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
20
views
12
references
Top references
cited by
7
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,950
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Interactive Theorem Proving
A Refinement-Based Approach to Computational Algebra in Coq
other
Author(s):
Maxime Dénès
,
Anders Mörtberg
,
Vincent Siles
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
Computational epistasis
Most cited references
12
Record
: found
Abstract
: not found
Article
: not found
Matrix multiplication via arithmetic progressions
Don Coppersmith
,
Shmuel Winograd
(1990)
0
comments
Cited
283
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Gaussian elimination is not optimal
Volker Strassen
(1969)
0
comments
Cited
273
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
On multiplication of 2 × 2 matrices
S. Winograd
(1971)
0
comments
Cited
28
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 83-98
DOI:
10.1007/978-3-642-32347-8_7
SO-VID:
a4119c56-5eb0-42be-90ca-512a6464f2aa
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
5,950
A Coq Formalization of Finitely Presented Modules
Authors:
Cyril Cohen
,
Anders Mörtberg
Derivatised α‐tocopherol as α CoQ
10
carrier in a novel water‐soluble formulation
Authors:
Marianna Sikorska
,
Henryk Borowy-Borowski
,
Bogdan Zurakowski
…
Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq
Authors:
Sylvie Boldo
,
Guillaume Melquiond
See all similar
Cited by
7
Refinements for Free!
Authors:
Cyril Cohen
,
Maxime Dénès
,
Anders Mörtberg
ML4PG in Computer Algebra Verification
Authors:
Jónathan Heras
,
Ekaterina Komendantskaya
A Formal Library for Elliptic Curves in the Coq Proof Assistant
Authors:
Evmorfia-Iro Bartzia
,
Pierre-Yves Strub
See all cited by