A cutoff theorem plus optimizations makes bounded model checking complete and scalable for positive existence and traceability properties in a DSLTrans fragment, with evaluation on 29 transformations and 899 properties.
Dynamiccutoffdetectioninparameterizedconcurrent programs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tractable Verification of Model Transformations: A Cutoff-Theorem Approach for DSLTrans
A cutoff theorem plus optimizations makes bounded model checking complete and scalable for positive existence and traceability properties in a DSLTrans fragment, with evaluation on 29 transformations and 899 properties.