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

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

Book chapters

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

A Saturation Method for Collapsible Pushdown Systems

Read this book at

Related collections

The Handbook of Systems Thinking

Most cited references 22

Alternation

Higher-Order Pushdown Trees Are Easy

Weighted pushdown systems and their application to interprocedural dataflow analysis

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 3,293

Cited by 10