DocumentCode
2718384
Title
When is `partial´ adequate? A logic-based proof technique using partial specifications
Author
Cleaveland, Rance ; Steffen, Bernhard
Author_Institution
Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA
fYear
1990
fDate
4-7 Jun 1990
Firstpage
440
Lastpage
449
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
Keywords
formal specification; compositional proof rules; correctness; logic-based proof technique; modal formula; parallel processes; partial process specification; partial specifications; specification adequacy; Calculus; Carbon capture and storage; Computer science; Concurrent computing; Context; State-space methods; Technological innovation;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1990. LICS '90, Proceedings., Fifth Annual IEEE Symposium on e
Conference_Location
Philadelphia, PA
Print_ISBN
0-8186-2073-0
Type
conf
DOI
10.1109/LICS.1990.113768
Filename
113768
Link To Document