On Detection of Bounded Global Predicates
The Computer Journal(1998)
摘要
Distributed programs often follow some bounded global predicates, for example, the total number of certain tokens is always the same or bounded in a range. In order to detect bounded global predicates, we can first derive the minimum and maximum global snapshots and then check if the minimum and maximum are out of the range. Recently, Chase and Garg proposed an efficient method to derive the minim...
更多查看译文
关键词
detection,global
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络