Decidability of reachability for polymorphic systems with arrays: a complete classification

MaRDI QIDQ2851060zbMATH OpenFDO

Authors Ranko Lazić

Publication date 2 October 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066105051972

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Polymorphic systems with arrays, 2-counter machines and multiset rewriting
• Communicating Sequential Processes. The First 25 Years
• Decision procedures for flat array properties
• First-order logic with reachability for infinite-state systems
• Verification, Model Checking, and Abstract Interpretation

Cited in

(3)

• Inference of bounded L systems with polymorphic P systems
• Polymorphic systems with arrays, 2-counter machines and multiset rewriting
• Algorithmic Analysis of Array-Accessing Programs

This page was built for publication: Decidability of reachability for polymorphic systems with arrays: a complete classification

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