Publications
Preprints
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
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
Information for reviewers
Review process
How to peer review
Peer review policy
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

Register Dashboard
Search
36
views
23
references
 Top references
cited by
11
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      1,973
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Interactive Theorem Proving 

      Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm

      other
      Author(s): ,
      Publication date (Print):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      Buy book
      Bookmark
          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

          Most cited references23

          • Record: found
          • Abstract: not found
          • Book: not found

          Isabelle/HOL

          Tobias Nipkow, Markus Wenzel, Lawrence Paulson (2002)
          Book 0 comments Cited 199 times – based on 0 reviews
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Proof of correctness of data representations

            C. Hoare (1972)
            Article 0 comments Cited 100 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON

              John Hopcroft (1971)
              Article 0 comments Cited 81 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2012
                Pages: 166-182
                DOI: 10.1007/978-3-642-32347-8_12
                SO-VID: 332cace9-6bb2-4b8e-a780-8a3c42e5d424
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content1,973

                See all similar

                Cited by11

                See all cited by