Multithreaded-Cartesian abstract interpretation of multithreaded recursive programs Is polynomial

DOI10.1007/978-3-319-24537-9_11MaRDI QIDQ1675156zbMATH OpenOpenAlexFDO

Authors Alexander Malkis

Publication date 27 October 2017

Full work available at URL https://doi.org/10.1007/978-3-319-24537-9_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Thread-Modular Verification Is Cartesian Abstract Interpretation
• Verifying multithreaded recursive programs with integer variables
• Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous
• CARET analysis of multithreaded programs
• Compositional termination proofs for multi-threaded programs
• Precise thread-modular abstract interpretation of concurrent programs using relational interference abstractions
• Predicate abstraction and refinement for verifying multi-threaded programs
• Complexity of pattern-based verification for multithreaded programs
• Realizability of Concurrent Recursive Programs
• Realizability of concurrent recursive programs

Cited in

(5)

• Thread-Modular Verification Is Cartesian Abstract Interpretation
• Complexity of pattern-based verification for multithreaded programs
• Decidable models of integer-manipulating programs with recursive parallelism
• Decidable models of integer-manipulating programs with recursive parallelism
• Verifying multithreaded recursive programs with integer variables

This page was built for publication: Multithreaded-Cartesian abstract interpretation of multithreaded recursive programs Is polynomial

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