Decidable models of integer-manipulating programs with recursive parallelism

DOI10.1007/978-3-319-45994-3_11MaRDI QIDQ5915901zbMATH OpenOpenAlexFDO

Authors Matthew Hague, Anthony Widjaja Lin

Publication date 26 March 2018

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Decidable models of integer-manipulating programs with recursive parallelism
• Verifying multithreaded recursive programs with integer variables
• Weakly-synchronized ground tree rewriting (with applications to verifying multithreaded programs)
• Multithreaded-Cartesian abstract interpretation of multithreaded recursive programs Is polynomial
• Analysis of recursively parallel programs

Cited in

(5)

• Decidable models of integer-manipulating programs with recursive parallelism
• Verifying multithreaded recursive programs with integer variables
• On store languages and applications
• Semilinearity of families of languages
• Weakly-synchronized ground tree rewriting (with applications to verifying multithreaded programs)

This page was built for publication: Decidable models of integer-manipulating programs with recursive parallelism

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