Sciweavers

207 search results - page 4 / 42
» Proof Systems and Transformation Games
Sort
View
POPL
2004
ACM
15 years 10 months ago
Simple relational correctness proofs for static analyses and program transformations
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...
Nick Benton
FMCAD
2004
Springer
15 years 1 months ago
Scalable Automated Verification via Expert-System Guided Transformations
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...
IANDC
2000
70views more  IANDC 2000»
14 years 9 months ago
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
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...
Christoph Kreitz, Stephan Schmitt
DFG
2009
Springer
15 years 4 months ago
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing
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...
Lasse Kliemann, Anand Srivastav
180
Voted
POPL
2009
ACM
15 years 10 months ago
Formal certification of code-based cryptographic proofs
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...
Benjamin Grégoire, Gilles Barthe, Santiago ...