We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specificationsthey support. Dynamically-chec...
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
Saddek Bensalem, Marius Bozga, Joseph Sifakis, Tha...
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...