Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation

DOI10.1007/s100090050041zbMath1059.68590OpenAlexW2005771507WikidataQ122616110 ScholiaQ122616110MaRDI QIDQ1856160

Lynett I. Millett, Tim Teigelbaum

Publication date: 2000

Published in: International Journal on Software Tools for Technology Transfer. STTT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s100090050041

zbMATH Keywords

model checkingstatic analysisprogram slicingconcurrent languages

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)

Related Items (6)

Combining static analysis and case-based search space partitioning for reducing peak memory in model checking ⋮ Combining search space partition and abstraction for LTL model checking ⋮ Actor-based slicing techniques for efficient reduction of Rebeca models ⋮ Slicing communicating automata specifications: Polynomial algorithms for model reduction ⋮ Slicing techniques for verification re-use ⋮ Next-preserving branching bisimulation

This page was built for publication: Issues in slicing PROMELA and its applications to model checking, protocol understanding, and simulation