93 search results - page 11 / 19 » Type-based nondeterminism checking in functional logic progr... |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
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...
APLAS
2007
ACM
2007
ACM
The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer
13 years 11 months ago
We rationally reconstruct the core of the Coccinelle system, used for automating and documenting collateral evolutions in Linux device drivers. A denotational semantics of the syst...
JAR
2008
13 years 7 months ago
2008
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
ICFP
2002
ACM
14 years 7 months ago
2002
ACM
We present the type theory LTT, intended to form a basis for typed target languages, providing an internal notion of logical proposition and proof. The inclusion of explicit proof...