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
64
views
16
references
Top references
cited by
21
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,214
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Programs with Lists Are Counter Automata
other
Author(s):
Ahmed Bouajjani
,
Marius Bozga
,
Peter Habermehl
,
Radu Iosif
,
Pierre Moro
,
Tomáš Vojnar
Publication date
(Print):
2006
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
16
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Abstract interpretation
Patrick Cousot
,
Radhia Cousot
(1977)
0
comments
Cited
364
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Parametric shape analysis via 3-valued logic
Mooly Sagiv
,
Thomas Reps
,
Reinhard Wilhelm
(2002)
0
comments
Cited
107
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
BI as an assertion language for mutable data structures
Samin Ishtiaq
,
Peter O'Hearn
(2001)
0
comments
Cited
39
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 517-531
DOI:
10.1007/11817963_47
SO-VID:
0c4f6c84-de9c-4b16-b34e-4c6ed0560f21
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Formal Specifications on Industrial-Strength Code—From Myth to Reality
pp. 17
Antichains: A New Algorithm for Checking Universality of Finite Automata
pp. 31
Safraless Compositional Synthesis
pp. 45
Minimizing Generalized Büchi Automata
pp. 59
Ticc: A Tool for Interface Compatibility and Composition
pp. 63
FAST Extended Release
pp. 81
A Fast Linear-Arithmetic Solver for DPLL(T)
pp. 137
Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop
pp. 234
Symmetry Reduction for Probabilistic Model Checking
pp. 249
Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
pp. 278
DiVinE – A Tool for Distributed Verification
pp. 286
Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions
pp. 300
Model Checking Multithreaded Programs with Asynchronous Atomic Methods
pp. 358
Repair of Boolean Programs with an Application to C
pp. 372
Termination of Integer Linear Programs
pp. 386
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
pp. 401
Termination Analysis with Calling Context Graphs
pp. 415
Terminator: Beyond Safety
pp. 419
CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools
pp. 452
Lookahead Widening
pp. 475
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
pp. 517
Programs with Lists Are Counter Automata
Similar content
2,214
An efficient design of parallel and serial shift registers based on quantum-dot cellular automata
Authors:
S. FAN
,
M.S. Khamesinia
Cellular Automata Models Simulating Slime Mould Computing
Authors:
Michail-Antisthenis I. Tsompanas
,
Georgios Ch. Sirakoulis
,
Andrew Adamatzky
Synchronization and maximum Lyapunov exponents of cellular automata
Authors:
Franco Bagnoli
,
Raúl Rechtman
See all similar
Cited by
21
Programs with Lists Are Counter Automata
Authors:
Ahmed Bouajjani
,
Marius Bozga
,
Peter Habermehl
…
A Verification Toolkit for Numerical Transition Systems
Authors:
Hossein Hojjat
,
Filip Konecny
,
Florent Garnier
…
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
Authors:
Ahmed Bouajjani
,
Peter Habermehl
,
Adam Rogalewicz
…
See all cited by