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
46
views
22
references
Top references
cited by
18
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,828
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Verification, Model Checking, and Abstract Interpretation
Inferring Canonical Register Automata
other
Author(s):
Falk Howar
,
Bernhard Steffen
,
Bengt Jonsson
,
Sofia Cassel
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
ScienceOpen Research
Most cited references
22
Record
: found
Abstract
: not found
Article
: not found
Finite-memory automata
Michael Kaminski
,
Nissim Francez
(1994)
0
comments
Cited
76
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Daikon system for dynamic detection of likely invariants
Matthew S. Tschantz
,
Stephen McCamant
,
Philip J. Guo
…
(2007)
0
comments
Cited
62
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Inference of Finite Automata Using Homing Sequences
R.L. Rivest
,
R.E. Schapire
(1993)
0
comments
Cited
34
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 251-266
DOI:
10.1007/978-3-642-27940-9_17
SO-VID:
7f85a00f-d937-4b89-a9cc-d304a1865828
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data
pp. 23
Software Verification with Liquid Types
pp. 24
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs
pp. 39
Whale: An Interpolation-Based Algorithm for Inter-procedural Verification
pp. 56
Synchronizability for Verification of Asynchronously Communicating Systems
pp. 72
On the Termination of Integer Loops
pp. 88
Verification of Gap-Order Constraint Abstractions of Counter Systems
pp. 104
On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking
pp. 119
Regression Verification for Multi-threaded Programs
pp. 136
Crowfoot: A Verifier for Higher-Order Store Programs
pp. 152
Synthesizing Protocols for Digital Contract Signing
pp. 169
Model Checking Information Flow in Reactive Systems
pp. 186
Splitting via Interpolants
pp. 202
Automatic Inference of Access Permissions
pp. 219
Lazy Synthesis
pp. 235
Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
pp. 251
Inferring Canonical Register Automata
pp. 267
Alternating Control Flow Reconstruction
pp. 283
Effective Synthesis of Asynchronous Systems from GR(1) Specifications
pp. 299
Sound Non-statistical Clustering of Static Analysis Alarms
pp. 315
Automating Induction with an SMT Solver
pp. 332
Modeling Asynchronous Message Passing for C Programs
pp. 348
Local Symmetry and Compositional Verification
pp. 363
versat: A Verified Modern SAT Solver
pp. 379
Decision Procedures for Region Logic
pp. 396
A General Framework for Probabilistic Characterizing Formulae
pp. 412
Loop Invariant Symbolic Execution for Parallel Programs
pp. 428
Synthesizing Efficient Controllers
pp. 445
Ideal Abstractions for Well-Structured Transition Systems
Similar content
1,828
An efficient design of parallel and serial shift registers based on quantum-dot cellular automata
Authors:
S. FAN
,
M.S. Khamesinia
Operational efficiency of novel SISO shift register under thermal randomness in quantum-dot cellular automata design
Authors:
J.C. das
,
D De
Cellular Automata Models Simulating Slime Mould Computing
Authors:
Michail-Antisthenis I. Tsompanas
,
Georgios Ch. Sirakoulis
,
Andrew Adamatzky
See all similar
Cited by
18
The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning
Authors:
Malte Isberner
,
Falk Howar
,
Bernhard Steffen
Symbolic Learning of Component Interfaces
Authors:
Dimitra Giannakopoulou
,
Zvonimir Rakamarić
,
Vishwanath Raman
Active learning for extended finite state machines
Authors:
Sofia Cassel
,
Falk Howar
,
Bengt. Jonsson
…
See all cited by