Hybrid analysis for partial order reduction of programs with arrays

DOI10.1007/978-3-662-49122-5_14MaRDI QIDQ2796057zbMATH OpenOpenAlexWikidataFDO

Authors Pavel Parizek

Publication date 23 March 2016

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

Full work available at URL https://doi.org/10.1007/978-3-662-49122-5_14

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Exploiting object escape and locking information in partial-order reductions for concurrent object-oriented programs
• Dynamic partial-order reduction for model checking software
• Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
• Combining partial-order reductions with on-the-fly model-checking.
• Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions

This page was built for publication: Hybrid analysis for partial order reduction of programs with arrays

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