Complexity of pattern-based verification for multithreaded programs
DOI10.1145/1926385.1926443zbMATH Open1284.68182OpenAlexW4242620488WikidataQ130964107 ScholiaQ130964107MaRDI QIDQ5408569FDOQ5408569
Authors: Javier Esparza, Pierre Ganty 
Publication date: 10 April 2014
Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1926385.1926443
Recommendations
- Multithreaded-Cartesian abstract interpretation of multithreaded recursive programs Is polynomial
- Causality-based verification of multi-threaded programs
- Constraint-based automatic verification of abstract models of multithreaded programs
- Abstract threads
- Thread-Modular Verification Is Cartesian Abstract Interpretation
Formal languages and automata (68Q45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (15)
- A complete refinement procedure for regular separability of context-free languages
- Generalised multi-pattern-based verification of programs with linear linked structures
- Causality-based verification of multi-threaded programs
- Parikh's theorem: a simple and direct automaton construction
- Reasoning about reversal-bounded counter machines
- Bounded underapproximations
- Title not available (Why is that?)
- Unboundedness problems for languages of vector addition systems
- Interprocedural reachability for flat integer programs
- Multithreaded-Cartesian abstract interpretation of multithreaded recursive programs Is polynomial
- Verifying multithreaded recursive programs with integer variables
- Constraint-based automatic verification of abstract models of multithreaded programs
- Checking a Multithreaded Algorithm with + CAL
- On the Complexity of Bounded Context Switching.
- Parametric runtime verification is NP-complete and coNP-complete
This page was built for publication: Complexity of pattern-based verification for multithreaded programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408569)
