Lecture Notes in Computer Science, Number 1912.
From Abstract State Machines: Theory and Applications (ASM 2000).
Edited by Yuri Gurevich and Phillip W. Kutter and Martin Odersky and Lothar Thiele.
Springer-Verlag, Monte Verità, Switzerland.
March, 2000.
Pages 287–302.

We give a brief overview of the Symbolic Analysis Laboratory (SAL) project. SAL is a verification framework that is directed at analyzing properties of transition systems by combining tools for program analysis, model checking, and theorem proving. SAL is built around a small intermediate language that serves as a semantic representation for transition systems that can be used to drive the various analysis tools.

@inproceedings{asm2000,
    AUTHOR = {Natarajan Shankar},
    TITLE = {Symbolic Analysis of Transition Systems},
    BOOKTITLE = {Abstract State Machines: Theory and Applications (ASM 2000)},
    YEAR = {2000},
    EDITOR = {Yuri Gurevich and Phillip {W.} Kutter and Martin Odersky and Lothar Thiele},
    SERIES = {Lecture Notes in Computer Science},
    NUMBER = {1912},
    PAGES = {287--302},
    ADDRESS = {Monte Verit\`{a}, Switzerland},
    MONTH = {mar},
    PUBLISHER = {Springer-Verlag},
    URL = {http://www.csl.sri.com/papers/asm2000/}
}

• asm2000.pdf
• asm2000.ps