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...
Abstract. Transformation-based verification has been proposed to synergistically leverage various transformations to successively simplify and decompose large problems to ones whic...
Hari Mony, Jason Baumgartner, Viresh Paruthi, Robe...
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
Abstract. We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results...
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...