A mapping from well-typed multiparty session processes to sequential, interaction-free programs preserves data flow up to weak operational correspondence, enabling model checking of data properties on an abstraction.
In: Proceedings of ICALP (2019), to appear
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Taming Concurrency for Verification Using Multiparty Session Types (Technical Report)
A mapping from well-typed multiparty session processes to sequential, interaction-free programs preserves data flow up to weak operational correspondence, enabling model checking of data properties on an abstraction.