Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
76
views
18
references
Top references
cited by
4
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,546
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Interactive Theorem Proving
Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
other
Author(s):
Peter Lammich
Publication date
(Print):
2014
Publisher:
Springer International Publishing
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
Computer Vision, Deep Learning, Deep Reinforcement Learning, IoT
Most cited references
18
Record
: found
Abstract
: not found
Book
: not found
Isabelle/HOL
Tobias Nipkow
,
Markus Wenzel
,
Lawrence Paulson
(2002)
0
comments
Cited
199
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Refinement Calculus
Ralph-Johan Back
,
Joakim Wright
(1998)
0
comments
Cited
55
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Memory-efficient algorithms for the verification of temporal properties
M Yannakakis
,
C. Courcoubetis
,
M Vardi
…
(1992)
0
comments
Cited
55
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2014
Pages
: 325-340
DOI:
10.1007/978-3-319-08970-6_21
SO-VID:
dce0f056-3575-4528-bd44-8eb8e03b8db8
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Microcode Verification – Another Piece of the Microprocessor Verification Puzzle
pp. 17
Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK
pp. 27
Towards a Formally Verified Proof Assistant
pp. 45
Implicational Rewriting Tactics in HOL
pp. 61
A Heuristic Prover for Real Inequalities
pp. 77
A Formal Library for Elliptic Curves in the Coq Proof Assistant
pp. 93
Truly Modular (Co)datatypes for Isabelle/HOL
pp. 111
Cardinals in Isabelle/HOL
pp. 128
Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code
pp. 144
Showing Invariance Compositionally for a Process Algebra for Network Protocols
pp. 160
A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
pp. 177
From Operational Models to Information Theory; Side Channels in pGCL with Isabelle
pp. 193
A Coq Formalization of Finitely Presented Modules
pp. 209
Formalized, Effective Domain Theory in Coq
pp. 226
Completeness and Decidability Results for CTL in Coq
pp. 242
Hypermap Specification and Certified Linked Implementation Using Orbits
pp. 258
A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
pp. 275
Experience Implementing a Performant Category-Theory Library in Coq
pp. 292
A New and Formalized Proof of Abstract Completion
pp. 308
HOL with Definitions: Semantics, Soundness, and a Verified Implementation
pp. 325
Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm
pp. 341
Recursive Functions on Lazy Lists via Domains and Topologies
pp. 358
Formal Verification of Optical Quantum Flip Gate
pp. 374
Compositional Computational Reflection
pp. 390
An Isabelle Proof Method Language
pp. 406
Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete
pp. 421
The Reflective Milawa Theorem Prover Is Sound
pp. 437
Balancing Lists: A Proof Pearl
pp. 450
Unified Decision Procedures for Regular Expression Equivalence
pp. 467
Collaborative Interactive Theorem Proving with Clide
pp. 483
On the Formalization of Z-Transform in HOL
pp. 499
Universe Polymorphism in Coq
pp. 515
Asynchronous User Interaction and Tool Integration in Isabelle/PIDE
pp. 531
HOL Constant Definition Done Right
pp. 537
Rough Diamond: An Extension of Equivalence-Based Rewriting
pp. 543
Formal C Semantics: CompCert and the C Standard
pp. 549
Mechanical Certification of Loop Pipelining Transformations: A Preview
Similar content
2,546
Experimentally Verified Numerical Optimization of a Three-Dimensional Parametrized Turbine Vane With Nonaxisymmetric End Walls
Authors:
Marc G. Nagel
,
Ralf-D. Baier
A tree-based forward digest protocol to verify data integrity in distributed media streaming
Authors:
J Chuang
,
D. Xu
,
A. Habib
…
Using wavelets to verify the scale structure of precipitation forecasts
Authors:
Sebastian Buschow
,
Petra Friederichs
See all similar
Cited by
4
Refinement to Imperative/HOL
Authors:
Peter Lammich
Efficient Verified (UN)SAT Certificate Checking
Authors:
Peter Lammich
Efficient Verification of Imperative Programs Using Auto2
Authors:
Bohua Zhan
See all cited by