The language theory of bounded context-switching

DOI10.1007/978-3-642-12200-2_10zbMATH Open1283.68197OpenAlexW2120105239MaRDI QIDQ3557012FDOQ3557012

Authors: Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato 

Publication date: 27 April 2010

Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/272455/1/fulltext.pdf

Recommendations

• Context-Bounded Analysis of Concurrent Queue Systems
• Interprocedural Analysis of Concurrent Programs Under a Context Bound
• Realizability of Concurrent Recursive Programs
• Reachability analysis of communicating pushdown systems
• Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (9)

• A perfect class of context-sensitive timed languages
• Analyzing timed systems using tree automata
• Revisiting underapproximate reachability for multipushdown systems
• Bounded underapproximations
• Automata and Logics for Concurrent Systems: Five Models in Five Pages
• Games on Multi-stack Pushdown Systems
• Ordered multi-stack visibly pushdown automata
• Formal grammars for turn-bounded deterministic context-free languages
• Bounded context switching for valence systems

This page was built for publication: The language theory of bounded context-switching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557012)