SAL. The Symbolic Analysis Laboratory is an environment for the exploration and analysis of concurrent systems specified as transition relations. Its language includes many of the attractive features of PVS. The SAL toolkit provides several tools for examining SAL specifications, including three different high-performance model checkers for LTL: symbolic, bounded, and infinite-bounded. The infinite-bounded model checker uses Yices to provide bounded model checking for systems defined over infinite data types, such as integers and reals. In addition, both the bounded and infinite-bounded model checkers can prove invariants by k-induction. SAL has been available since 2002, and has been Open Source since Version 3.0, released in December 2006.
Keywords for this software
References in zbMATH (referenced in 8 articles , 1 standard article )
Showing results 1 to 8 of 8.
- Rushby, John: The versatile synchronous observer (2014)
- Rushby, John: The versatile synchronous observer (2012)
- Calvagna, Andrea; Gargantini, Angelo: A formal logic approach to constrained combinatorial testing (2010)
- Tsiopoulos, Leonidas; Satpathy, Manoranjan: Model based testing of a network-on-chip component (2009)
- Fraser, Gordon; Wotawa, Franz: Using model-checkers to generate and analyze property relevant test-cases. (2008)
- Hamon, Grégoire; Rushby, John: An operational semantics for stateflow (2007)
- de Moura, Leonardo; Owre, Sam; Rueß, Harald; Rushby, John; Shankar, N.; Sorea, Maria; Tiwari, Ashish: SAL 2 (2004)
- Moura, Leonardo de; Owre, Sam; Rueß, Harald; Rushby, John; Shankar, Natarajan: The ICS decision procedures for embedded deduction (2004)