Institutional Repository
| auxiliary constructs for proving liveness in compassion discrete systems | |
| Long Teng; Zhang Wenhui | |
| 2010 | |
| Conference Name | 8th International Symposium on Automated Technology for Verification and Analysis, ATVA 2010 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 276-290 |
| Conference Date | September |
| Conference Place | Singapore, Singapore |
| Indexed Type | EI |
| Publish Place | Germany |
| ISSN | 3029743 |
| ISBN | 3642156428 |
| Department | (1) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) School of Information Science and Engineering, Graduate University, China Academy of Sciences, Beijing, China |
| English Abstract | For proving response properties in systems with compassion requirements, a deductive rule is introduced in [1]. 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 [2] computes ranking functions for response properties in systems with justice requirements. This paper presents an approach which extends the work in [2] with compassion requirements. The approach is illustrated on two examples of sequential and concurrent programs. © 2010 Springer-Verlag Berlin Heidelberg. |
| Sponsorship | National University of Singapore |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/8678 |
| Collection | 基础软件与系统重点实验室 |
| Recommended Citation GB/T 7714 | Long Teng,Zhang Wenhui. auxiliary constructs for proving liveness in compassion discrete systems[C]. Germany,2010:276-290. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| auxiliary constructs（270KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment