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
11
references
Top references
cited by
11
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,473
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Verification, Model Checking, and Abstract Interpretation
Lattice Automata
other
Author(s):
Orna Kupferman
,
Yoad Lustig
Publication date
(Print):
2007
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
11
Record
: found
Abstract
: not found
Article
: not found
Finite Automata and Their Decision Problems
M. Rabin
,
Richard D Scott
(1959)
0
comments
Cited
222
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Nondeterministic Space is Closed under Complementation
Neil Immerman
(1988)
0
comments
Cited
66
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Alternating finite automata on ω-words
Takeshi Hayashi
,
Satoru Miyano
(1984)
0
comments
Cited
52
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Pages
: 199-213
DOI:
10.1007/978-3-540-69738-1_14
SO-VID:
dc249daa-b03b-4d45-9c71-95bd389713d6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
DIVINE: DIscovering Variables IN Executables
pp. 29
Verifying Compensating Transactions
pp. 44
Model Checking Nonblocking MPI Programs
pp. 59
Model Checking Via ΓCFA
pp. 74
Using First-Order Theorem Provers in the Jahob Data Structure Verification System
pp. 89
Interpolants and Symbolic Model Checking
pp. 91
Shape Analysis of Single-Parent Heaps
pp. 106
An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures
pp. 122
On Flat Programs with Lists
pp. 137
Automata-Theoretic Model Checking Revisited
pp. 151
Language-Based Abstraction Refinement for Hybrid System Verification
pp. 167
More Precise Partition Abstractions
pp. 182
The Spotlight Principle
pp. 199
Lattice Automata
pp. 214
Learning Algorithms and Formal Verification (Invited Tutorial)
pp. 215
Constructing Specialized Shape Analyses for Uniform Change
pp. 234
Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning
pp. 251
Automated Verification of Shape and Size Properties Via Separation Logic
pp. 267
Towards Shape Analysis for Device Drivers
pp. 268
An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints
pp. 283
Cibai: An Abstract Interpretation-Based Static Analyzer for Modular Analysis and Verification of Java Classes
pp. 299
Symmetry and Completeness in the Analysis of Parameterized Systems
pp. 314
Better Under-Approximation of Programs by Hiding Variables
pp. 329
The Constraint Database Approach to Software Verification
pp. 346
Constraint Solving for Interpolation
pp. 363
Assertion Checking Unified
Similar content
2,473
Capturing the varying effects of driving forces over time for the simulation of urban growth by using survival analysis and cellular automata
Authors:
Xia Li
,
Shaoying Li
,
Bin Ai
…
Event‐triggered hybrid control strategy based on hybrid automata and decision tree for microgrid
Authors:
Chunxia Dou
,
Shengqi Teng
,
Tengfei Zhang
…
The Game of Urban Attractiveness - Shape Grammars and Cellular Automata Based Tool for Prediction of Human's Behaviour in Cities
Authors:
Pawel Unger
,
Luis Fernando de França ROMÃO
See all similar
Cited by
11
Quantitative Languages
Authors:
Krishnendu Chatterjee
,
Laurent Doyen
,
Thomas Henzinger
Ranking Automata and Games for Prioritized Requirements
Authors:
Rajeev Alur
,
Aditya Kanade
,
Gera Weiss
Energy and Mean-Payoff Games with Imperfect Information
Authors:
Aldric Degorre
,
Laurent Doyen
,
Raffaella Gentilini
…
See all cited by