An Overview of SAL (2000)
| Venue: | LFM 2000: Fifth NASA Langley Formal Methods Workshop |
| Citations: | 38 - 5 self |
BibTeX
@INPROCEEDINGS{Bensalem00anoverview,
author = {Saddek Bensalem and Vijay Ganesh and Yassine Lakhnech and Cesar Muñoz and Sam Owre and Harald Rueß and John Rushby and Vlad Rusu and Hassen Saïdi and N. Shankar and Eli Singerman and Ashish Tiwari},
title = {An Overview of SAL},
booktitle = {LFM 2000: Fifth NASA Langley Formal Methods Workshop},
year = {2000},
pages = {187--196}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
To become practical for assurance formal methods must be made more cost-effective and must contribute to both debugging and certification. Furthermore, the style of interaction must reflect the concerns of a designer rather than the peculiarities of a prover. SAL (Symbolic Analysis Laboratory) attempts to address these issues. It is a framework for combining different tools to calculate properties (i.e., performing symbolic analysis) 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 calculate properties (i.e., perform symbolic analysis) of concurrent systems. We describe the motivation, the language, the tools, and their integration in SAL/PVS, and some preliminary experience of their use. ...
