Constraint-based automatic verification of abstract models of multithreaded programs

DOI10.1017/S1471068406002821MaRDI QIDQ3430665zbMATH OpenFDO

Authors Giorgio Delzanno

Publication date 23 March 2007

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1471068406002821

zbMATH Keywords

constraintsmultithreaded programsverification

Mathematics Subject Classification ID

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

Recommendations

• Abstract threads
• scientific article; zbMATH DE number 2080048
• Proof spaces for unbounded parallelism
• Verification of concurrent programs using Petri net unfoldings
• Complexity of pattern-based verification for multithreaded programs

Cited in

(7)

• Abstract threads
• scientific article; zbMATH DE number 2080048 (Why is no real title available?)
• Well structured transition systems with history
• Complexity of pattern-based verification for multithreaded programs
• The ω-Regular Post Embedding Problem
• Towards Efficient Verification of Systems with Dynamic Process Creation
• Decidability and complexity of Petri nets with unordered data

This page was built for publication: Constraint-based automatic verification of abstract models of multithreaded programs

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