Abstract. Theorem-prover based modular checkers have the potential to perform scalable and precise checking of user-defined properties by combining pathsensitive intraprocedural re...
Thomas Ball, Brian Hackett, Shuvendu K. Lahiri, Sh...
Comparing context of different entities is not easy at all. Since context depends on the situation of a particular entity it can be understood in different ways by various entitie...
A variety of compilers, static analyses, and testing frameworks rely heavily on path frequency information. Uses for such information range from optimizing transformations to bug ...
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Gi...