加载中…
2023-08-19
Verification of Sometimes Termination of Lazy-Bounded Declarative Distributed Systems
Francesco Di Cosmo
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本