Weakly-synchronized ground tree rewriting (with applications to verifying multithreaded programs)

DOI10.1007/978-3-642-32589-2_55MaRDI QIDQ2912762zbMATH OpenOpenAlexFDO

Authors Anthony Widjaja Lin

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_55

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Decidable models of integer-manipulating programs with recursive parallelism
• Decidable models of integer-manipulating programs with recursive parallelism
• On symbolic verification of weakly extended PAD
• Verifying multithreaded recursive programs with integer variables
• Constrained Reachability of Process Rewrite Systems

Cited in

(6)

• On symbolic verification of weakly extended PAD
• On the index of convergence of a class of Boolean matrices with structural properties
• Verifying multithreaded recursive programs with integer variables
• Refining the process rewrite systems hierarchy via ground tree rewrite systems
• Decidable models of integer-manipulating programs with recursive parallelism
• Decidable models of integer-manipulating programs with recursive parallelism

This page was built for publication: Weakly-synchronized ground tree rewriting (with applications to verifying multithreaded programs)

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