249 search results - page 5 / 50 » Principals in Programming Languages: A Syntactic Proof Techn... |
209
click to vote
POPL
2009
ACM
16 years 8 days ago
2009
ACM
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...
100
click to vote
POPL
2010
ACM
15 years 9 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
POPL
2012
ACM
13 years 7 months ago
2012
ACM
We develop logical mechanisms and decision procedures to facilitate the verification of full functional properties of inductive tree data-structures using recursion that are soun...
POPL
2010
ACM
15 years 9 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...