The language theory of bounded context-switching

DOI10.1007/978-3-642-12200-2_10MaRDI QIDQ3557012zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(10)

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

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)