Name
Abstract | ||
|---|---|---|
SAL (see http://sal.csl.sri.com) is an open suite of tools for analysis of state machines; it constitutes part of our vision for a Symbolic Analysis Laboratory that will eventually encompass SAL, the PVS verification system, the ICS decision procedures, and other tools developed
in our group and elsewhere.
SAL provides a language similar to that of PVS, but specialized for the specification of state machines; it was first released
with an explicit-state model checker as SAL 1 in July 2002; SAL 2, which was released in December 2003, adds high-performance
symbolic and bounded model checkers, and novel infinite bounded and witness model checkers. Both the bounded model checkers can additionally perform verification by k-induction, and the capabilities of all the model checkers and their components are available through an API that is scriptable
in Scheme.
|
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-27813-9_45 | CAV |
DocType | Citations | PageRank |
Conference | 42 | 1.81 |
References | Authors | |
1 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leonardo de Moura | 1 | 3539 | 150.15 |
| Sam Owre | 2 | 1323 | 104.39 |
| Harald Rueß | 3 | 526 | 38.69 |
| John Rushby | 4 | 2459 | 235.69 |
| Natarajan Shankar | 5 | 3050 | 309.55 |
| Maria Sorea | 6 | 302 | 17.44 |
| Ashish Tiwari | 7 | 1630 | 106.62 |