76
Voted
LDTA
2010
15 years 18 days ago
2010
74
Voted
LDTA
2010
15 years 18 days ago
2010
ICFP
2010
ACM
15 years 18 days ago
2010
ACM
105
Voted
ICFP
2010
ACM
15 years 18 days ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
141
click to vote
ICFP
2010
ACM
15 years 18 days ago
2010
ACM
We describe the design, implementation, and use of a machinecertified framework for correct compilation and execution of programs in garbage-collected languages. Our framework ext...
126
Voted
APLAS
2010
ACM
15 years 19 days ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
92
Voted
APLAS
2010
ACM
15 years 19 days ago
2010
ACM
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
113
Voted
APLAS
2010
ACM
15 years 19 days ago
2010
ACM
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
100
click to vote
APLAS
2010
ACM
15 years 19 days ago
2010
ACM
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
101
Voted
APLAS
2010
ACM
15 years 19 days ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...