Multithreaded-Cartesian abstract interpretation of multithreaded recursive programs Is polynomial

DOI10.1007/978-3-319-24537-9_11zbMATH Open1471.68073OpenAlexW2408504828MaRDI QIDQ1675156

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

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

Recommendations

• Realizability of concurrent recursive programs 👍 👎
• CARET analysis of multithreaded programs 👍 👎
• Compositional Termination Proofs for Multi-threaded Programs 👍 👎
• Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions 👍 👎
• Thread-Modular Verification Is Cartesian Abstract Interpretation 👍 👎
• Realizability of Concurrent Recursive Programs 👍 👎
• Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous 👍 👎
• Verifying Multithreaded Recursive Programs with Integer Variables 👍 👎
• Predicate abstraction and refinement for verifying multi-threaded programs 👍 👎
• Complexity of pattern-based verification for multithreaded programs 👍 👎

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