Auxiliary Constructs for Proving Liveness in Compassion Discrete Systems
For proving response properties in systems with compassion requirements, a deductive rule is introduced in . In order to use the rule, auxiliary constructs are needed. They include helpful assertions and ranking functions defined on a well-founded domain. The work in  computes ranking functions for response properties in systems with justice requirements. This paper presents an approach which extends the work in  with compassion requirements. The approach is illustrated on two examples of sequential and concurrent programs.
Unable to display preview. Download preview PDF.
- 4.Ball, T., Majumdar, R., Millstein, T.D., Rajamani, S.K.: Automatic predicate abstraction of c programs. In: PLDI, pp. 203–213 (2001)Google Scholar
- 5.Long, T., Zhang, W.: Auxiliary constructs for proving liveness in compassion discrete systems. Technical Report, ISCAS–LCS–09–03, Institute of Sofware, Chinese Academy of Sciences (2009), http://lcs.ios.ac.cn/~zwh/tr/