LDTA
2010
13 years 11 months ago
2010
LDTA
2010
13 years 11 months ago
2010
ICFP
2010
ACM
13 years 11 months ago
2010
ACM
ICFP
2010
ACM
13 years 11 months 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...
ICFP
2010
ACM
13 years 11 months 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...
APLAS
2010
ACM
13 years 11 months 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...
APLAS
2010
ACM
13 years 11 months 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...
APLAS
2010
ACM
13 years 11 months 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...
APLAS
2010
ACM
13 years 11 months 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...
APLAS
2010
ACM
13 years 11 months 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...