Verification of Sometimes Termination of Lazy-Bounded Declarative Distributed Systems

08/19/2023

∙

by   Francesco Di Cosmo, et al.

∙

0

∙

share

Declarative Distributed Systems (DDSs) are distributed systems grounded in logic programming. Although DDS model-checking is undecidable in general, we detect decidable cases by tweaking the data-source bounds, the message expressiveness, and the channel type.