Liveness Properties in CafeOBJ – A Case Study for Meta-Level Specifications
We provide an innovative development of algebraic specifications and proof scores in CafeOBJ by extending a base specification to the meta-level that includes infinite transition sequences. The infinite transition sequences are modeled using behavioral specifications with hidden sort, and make it possible to prove safety and liveness properties in a uniform way.
As an example of the development, we present a specification of Dijkstra’s binary semaphore, a protocol to guarantee exclusive access to a resource. For this protocol we will give three different properties, one being the mutual exclusion (or safety) property, and two more regarding different forms of liveness, which we call progress property and entrance property. These three properties are verified in a computationally uniform way (by term rewriting) based on the new development.
Besides being a case study of modeling meta-properties in CafeOBJ, we provide an initial characterization of strength of various properties. Furthermore, this method can serve as a blue-print for other specifications, in particular those based on Abstract State System (ASSs).
KeywordsAlgebraic specification Liveness CafeOBJ Verification
- 2.Bae, K., Meseguer, J.: Infinite-state model checking of LTLR formulas unsing narrowing. In: WRLA 2014, 10th International Workshop on Rewriting Logic and its Applications, to appearGoogle Scholar
- 4.Chandy, K.M., Misra, J.: Parallel Program Design—A Foundation. Addison-Wesley, Boston (1989)Google Scholar
- 6.Futatsugi, K.: Generate and check methods for invariant verification in CafeOBJ. In: JAIST Research Report IS-RR-2013-006, http://hdl.handle.net/10119/11536 (2013)
- 7.Futatsugi, K.: Generate and check method for verifying transition systems in CafeOBJ. Submitted for publication (2014)Google Scholar
- 9.Goguen, J.A., Lin., K.: Behavioral verification of distributed concurrent systems with BOBJ. In: QSIC, pp. 216–235. IEEE Computer Society (2003)Google Scholar
- 13.Ogata, K., Futatsugi, K.: Proof score approach to verification of liveness properties. IEICE Trans. 91–D(12), 2804–2817 (2008)Google Scholar
- 16.Podelski, A., Rybalchenko, A.: Transition invariants. In: LICS, pp. 32–41. IEEE Computer Society (2004)Google Scholar
- 17.Preining, N.: Specifications in CafeOBJ http://www.preining.info/blog/cafeobj/
- 18.Preining, N., Futatsugi, K., Ogata, K.: Proving liveness properties using abstract state machines and \(n\)-visibility. In: Talk at the 22nd International Workshop on Algebraic Development Techniques WADT 2014, Sinaia, Romania, September 2014Google Scholar
- 21.Wierman, A.: Fairness and scheduling in single server queues. Surv. Oper. Res. Manag. Sci. 16(1), 39–48 (2011)Google Scholar