For invariant checking, M OCHA supports both symbolic and enumerative search. Implementation verification by checking trace containment between implementation and specification modules. M OCHA supports containment checking if the specification module has no hidden state, and simulation checking otherwise. For decomposing proofs, M OCHA supports an assume-guarantee principle. Version 2.0 of jMocha explicitly supports only invariant checking and refinement checking, but no temporal logic model checking.
Slang provides primitive functions for symbolic manipulation of transitions systems and states.
Unlike with cMocha, new symbolic algorithms can be developed by writing Slang scripts. Please send questions or comments about M OCHA here . This site is maintained by the mocha-webmaster . Mirror sites are maintained at the University of California at Berkeley and the SUNY at Stony Brook .