×

MOPS

swMATH ID: 10117
Software Authors: Chen, H., Wagner, D.
Description: MOPS: an infrastructure for examining security properties of software. We describe a formal approach for finding bugs in security-relevant software and verifying their absence. The idea is as follows: we identify rules of safe programming practice, encode them as safety properties, and verify whether these properties are obeyed. Because manual verification is too expensive, we have built a program analysis tool to automate this process. Our program analysis models the program to be verified as a pushdown automaton, represents the security property as a finite state automaton, and uses model checking techniques to identify whether any state violating the desired security goal is reachable in the program. The major advantages of this approach are that it is sound in verifying the absence of certain classes of vulnerabilities, that it is fully interprocedural, and that it is efficient and scalable. Experience suggests that this approach will be useful in finding a wide range of security vulnerabilities in large programs efficiently.
Homepage: http://web.cs.ucdavis.edu/~hchen/mops/
Related Software: SLAM; BLAST; SPIN; Bebop; CIL; SIMPLIFY; PQL; Bandera; CCured; SatAbs; CBMC; Zing; CVC; ESC/Java; MiniSat; CESAR; Uppaal; Java PathFinder; veriSoft; PMD
Cited in: 15 Publications
Further Publications: http://web.cs.ucdavis.edu/~hchen/mops/#paper

Citations by Year