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
35
views
22
references
Top references
cited by
10
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,492
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automata, Languages, and Programming
A Saturation Method for Collapsible Pushdown Systems
other
Author(s):
Chris Broadbent
,
Arnaud Carayol
,
Matthew Hague
,
Olivier Serre
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
The Handbook of Systems Thinking
Most cited references
22
Record
: found
Abstract
: not found
Article
: not found
Alternation
Ashok K. Chandra
,
Dexter Kozen
,
Larry Stockmeyer
(1981)
0
comments
Cited
112
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Higher-Order Pushdown Trees Are Easy
Teodor Knapik
,
Damian Niwinski
,
Paweł Urzyczyn
(2002)
0
comments
Cited
29
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Weighted pushdown systems and their application to interprocedural dataflow analysis
Somesh Jha
,
Thomas Reps
,
Stefan Schwoon
…
(2005)
0
comments
Cited
23
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 165-176
DOI:
10.1007/978-3-642-31585-5_18
SO-VID:
13ffc75d-de2f-4ce6-a078-ac0b526ed67d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 42
Streaming Tree Transducers
pp. 636
Online Mechanism Design (Randomized Rounding on the Fly)
pp. 165
A Saturation Method for Collapsible Pushdown Systems
pp. 263
Exponential Lower Bounds and Separation for Query Rewriting
pp. 561
Byzantine Agreement with a Rational Adversary
pp. 573
Random Hyperbolic Graphs: Degree Sequence and Clustering
pp. 598
Counting Arbitrary Subgraphs in Data Streams
pp. 660
Distributed Algorithms for Network Diameter and Girth
Similar content
3,492
V-Star: Learning Visibly Pushdown Grammars from Program Inputs
Authors:
Xiaodong Jia
,
Gang Tan
On the Expressive Power of 2-Stack Visibly Pushdown Automata
Authors:
Binary Reachability Analysis of Discrete Pushdown Timed Automata
Authors:
Zhe Dang
,
Oscar H. Ibarra
,
Tevfik Bultan
…
See all similar
Cited by
10
Using Models to Model-Check Recursive Schemes
Authors:
Sylvain Salvati
,
Igor Walukiewicz
Saturation algorithms for model-checking pushdown systems
Authors:
Arnaud Carayol
,
Matthew Hague
Annotated Stack Trees
Authors:
,
See all cited by