Sciweavers

233 search results - page 16 / 47
» Specifying, Programming and Verifying with Equational Logic
Sort
View
ICFP
2005
ACM
15 years 11 months ago
Types with semantics: soundness proof assistant
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
Olha Shkaravska
POPL
2007
ACM
15 years 11 months ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...
169
Voted
POPL
2003
ACM
15 years 11 months ago
Toward a foundational typed assembly language
We present the design of a typed assembly language called TALT that supports heterogeneous tuples, disjoint sums, and a general account of addressing modes. TALT also implements t...
Karl Crary
POPL
2005
ACM
15 years 11 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
PPDP
2009
Springer
15 years 5 months ago
Model-checking higher-order functions
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
Naoki Kobayashi