| タイトル | An Overview of SAL |
| 本文（外部サイト） | http://hdl.handle.net/2060/20000055733 |
| 著者（英） | Shankar, N.; Bensalem, Saddek; Saiedi, Hassen; Lakhnech, Yassine; Munoz, Cesar; Ruess, Harald; Rusu, Vlad; Owre, Sam; Rushby, John; Ganesh, Vijay |
| 著者所属（英） | SRI International Corp. |
| 発行日 | 2000-06-01 |
| 言語 | eng |
| 内容記述 | To become practical for assurance, automated formal methods must be made more scalable, automatic, and cost-effective. Such an increase in scope, scale, automation, and utility can be derived from an emphasis on a systematic separation of concerns during verification. SAL (Symbolic Analysis Laboratory) attempts to address these issues. It is a framework for combining different tools to calculate properties of concurrent systems. The heart of SAL is a language, developed in collaboration with Stanford, Berkeley, and Verimag for specifying concurrent systems in a compositional way. Our instantiation of the SAL framework augments PVS with tools for abstraction, invariant generation, program analysis (such as slicing), theorem proving, and model checking to separate concerns as well as calculate properties (i.e., perform, symbolic analysis) of concurrent systems. We. describe the motivation, the language, the tools, their integration in SAL/PAS, and some preliminary experience of their use. |
| NASA分類 | Computer Programming and Software |
| 権利 | No Copyright |
|
