Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural descripti...
John Herbert, Bruno Dutertre, Robert A. Riemenschn...
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
Carsten Lund, Lance Fortnow, Howard J. Karloff, No...
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show t...