Chapter

Computer Aided Verification

Volume 3114 of the series Lecture Notes in Computer Science pp 496-500

SAL 2

  • Leonardo de MouraAffiliated withComputer Science Laboratory, SRI International
  • , Sam OwreAffiliated withComputer Science Laboratory, SRI International
  • , Harald RueßAffiliated withComputer Science Laboratory, SRI International
  • , John RushbyAffiliated withComputer Science Laboratory, SRI International
  • , N. ShankarAffiliated withComputer Science Laboratory, SRI International
  • , Maria SoreaAffiliated withComputer Science Laboratory, SRI International
  • , Ashish TiwariAffiliated withComputer Science Laboratory, SRI International

* Final gross prices may vary according to local VAT.

Get Access

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.