Institutional Repository
| When is `partial' adequate? A logic-based proof technique using partial specifications | |
| Cleaveland R.; Steffen B. | |
| 1990 | |
| Conference Name | Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e |
| Conference Date | 1990-06-04~1990-06-07 |
| Conference Place | Philadelphia, PA |
| Indexed Type | 其他 |
| Cooperation Status | 其它 |
| ISBN | 0-8186-2073-0 |
| English Abstract | A technique is presented for ascertaining when a (finite-state) partial process specification is adequate, in the sense of being specified enough, for contexts in which it is to be used. The method relies on the automatic generation of a modal formula from the partial specification; if the remainder of the network satisfies this formula, then any process that meets the specification is guaranteed to ensure correct behavior of the overall system. Using the results, the authors develop compositional proof rules for establishing the correctness of networks of parallel processes and illustrate their use with several examples |
| Language | 中文 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/1339 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Cleaveland R.,Steffen B.. When is `partial' adequate? A logic-based proof technique using partial specifications[C],1990. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 440-449.pdf（725KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment