Proofs of progress properties often require fairness assumptions. Directly incorporating global fairness assumptions in a compositional method is difficult, given the local flavor of such reasoning. We present a fully automated local reasoning algorithm which handles fairness assumptions through a process of iterative refinement. Refinement strengthens local proofs by the addition of auxiliary shared variables which expose internal process state; it is needed as local reasoning is inherently incomplete. Experiments demonstrate that the new algorithm shows significant improvement over standard model checking. © 2010 Springer-Verlag.
CITATION STYLE
Cohen, A., Namjoshi, K. S., & Sa’ar, Y. (2010). A dash of fairness for compositional reasoning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 543–557). https://doi.org/10.1007/978-3-642-14295-6_46
Mendeley helps you to discover research relevant for your work.