Sciweavers

LDTA
2010
13 years 7 months ago
Specifying generic Java programs: two case studies
Alain Giorgetti, Claude Marché, Elena Tushk...
ICFP
2010
ACM
13 years 7 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
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...
Karl Mazurak, Steve Zdancewic
ICFP
2010
ACM
13 years 7 months ago
A certified framework for compiling and executing garbage-collected languages
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...
Andrew McCreight, Tim Chevalier, Andrew P. Tolmach
APLAS
2010
ACM
13 years 7 months ago
Typechecking Higher-Order Security Libraries
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...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
APLAS
2010
ACM
13 years 7 months ago
A Logical Mix of Approximation and Separation
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...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
APLAS
2010
ACM
13 years 7 months ago
Data Structure Fusion
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...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
APLAS
2010
ACM
13 years 7 months ago
Reasoning about Computations Using Two-Levels of Logic
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...
Dale Miller
APLAS
2010
ACM
13 years 7 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
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...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi