## Supporting case analysis with algebraic specification languages (2004)

Venue: | In 4th CIT |

Citations: | 1 - 1 self |

### BibTeX

@INPROCEEDINGS{Seino04supportingcase,

author = {Takahiro Seino},

title = {Supporting case analysis with algebraic specification languages},

booktitle = {In 4th CIT},

year = {2004},

pages = {1100--1107},

publisher = {IEEE CS Press}

}

### OpenURL

### Abstract

Case analysis is essential for verification of computer systems by writing proof scores in algebraic specification languages. When case analysis is performed, it is indispensable to cover all cases and find basic predicates that can be used for splitting cases. We propose two methods to support case analysis, which concern the two things. The first method uses matrices to cover all cases. The matrices consist of predicates that come from transition rules ’ conditions and properties to be verified. If it is not sufficient to split cases with such matrices, we must find basic predicates in the specifications of computer systems to split cases more precisely. Given a set of basic predicates, the second method mostly automates this process, which also can help find necessary lemmas. A case study in which our methods are effectively applied to a railroad signaling system is also reported. 1.

### Citations

586 | Dynamically discovering likely program invariants to support program evolution
- Ernst, Cockrell, et al.
- 2001
(Show Context)
Citation Context ...ld help further improve understandability of proofs with CafeOBJ. Win, et al.[14] propose a methodology for proving properties of distributed systems. In the methodology, the Daikon invariant detector=-=[4]-=- is used, which conjecture properties that are most likely invariants in distributed systems by analyzing finite sequences of execution. Such a tool is very useful in verification with the CafeOBJ sys... |

26 | Using simulated execution in verifying distributed algorithms
- Win, Ernst, et al.
(Show Context)
Citation Context ...with matrices improve understandability of proofs written in algebraic specification languages. But, the Tatami project could help further improve understandability of proofs with CafeOBJ. Win, et al.=-=[14]-=- propose a methodology for proving properties of distributed systems. In the methodology, the Daikon invariant detector[4] is used, which conjecture properties that are most likely invariants in distr... |

15 | Proof scores in the OTS/CafeOBJ method
- Ogata, Futatsugi
- 2003
(Show Context)
Citation Context ...there exists a universal state space called Υ. We also suppose that each data type used has been defined beforehand, including the equivalence between two data values v1, v2 denoted by v1 = v2. An OTS=-=[11]-=- (Observational Transition System) S = 〈O, I, T 〉 consists of: • O : A set of observable values. Each o ∈ O is a function o : Υ → D, where D is a data type. Given an OTS S and two states υ1, υ2 ∈ Υ, t... |

7 |
Formal analysis of suzuki&kasami distributed mutual exclusion algorithm
- Ogata, Futatsugi
- 2002
(Show Context)
Citation Context ...erties by writing proof scores in CafeOBJ and having the CafeOBJ system execute (or rewrite) the proof scores. We have demonstrated the effectiveness of our approach by performing several case studies=-=[12, 10, 9, 7, 8]-=-. However, proof scores have been entirely written by hand, which means that human errors might have occurred. To minimize human errors, writing proof scores should be mechanically supported. In this ... |

6 |
Isabelle/HOL — A Proof Assistant for Higer-Order Logic
- Nipkow, Paulson, et al.
(Show Context)
Citation Context ... transition system, model checking techniques may be the most useful. Otherwise, theorem proving techniques should be used. Many tools supporting theorem proving have been proposed such as Isabell/HOL=-=[6]-=- and PVS[13]. Our approach uses CafeOBJ, an algebraic specification language/system. The CafeOBJ’s basic mechanism for theorem proving is rewriting, which is an efficient way of implementing equationa... |

5 |
Rewriting-based verification of authentication protocols
- Ogata, Futatsugi
- 2002
(Show Context)
Citation Context ...erties by writing proof scores in CafeOBJ and having the CafeOBJ system execute (or rewrite) the proof scores. We have demonstrated the effectiveness of our approach by performing several case studies=-=[12, 10, 9, 7, 8]-=-. However, proof scores have been entirely written by hand, which means that human errors might have occurred. To minimize human errors, writing proof scores should be mechanically supported. In this ... |

3 |
CafeOBJ report. Number 6
- Diaconescu, Futatsugi
- 1998
(Show Context)
Citation Context ...ains run according to a staff system (or a tablet blocking system) that is a railroad signaling system. The case study is also reported in this paper.s2 Preliminaries 2.1 CafeOBJ in a Nutshell CafeOBJ=-=[1, 3]-=- can be used to specify abstract machines as well as abstract data types. A visible sort denotes an abstract data type, while a hidden sort the state space of an abstract machine. There are two kinds ... |

3 |
Formal verification of the MCS list-based queuing lock
- Ogata, Futatsugi
- 1999
(Show Context)
Citation Context ...erties by writing proof scores in CafeOBJ and having the CafeOBJ system execute (or rewrite) the proof scores. We have demonstrated the effectiveness of our approach by performing several case studies=-=[12, 10, 9, 7, 8]-=-. However, proof scores have been entirely written by hand, which means that human errors might have occurred. To minimize human errors, writing proof scores should be mechanically supported. In this ... |

3 | Specification and verification of a single-track railroad signaling in CafeOBJ
- Seino, Ogata, et al.
- 2001
(Show Context)
Citation Context |

2 |
Specifying and verifying a railroad crossing with CafeOBJ
- unknown authors
- 2001
(Show Context)
Citation Context |

1 |
Web based support for cooperative software engineering
- Goguen, Lin
- 2000
(Show Context)
Citation Context ...ed methods help automate proof activities with the CafeOBJ system. One of the prior tools supporting verification of computer systems with algebraic specification languages is the Kumo proof assistant=-=[5]-=- that has been designed and implemented in the Tatami project[2] directed by Goguen. Commands fed into Kumo are written in the Duck language. Duck includes commands that implement proof rules for hidd... |