632 search results - page 79 / 127 » Proving Invariants of Functional Programs |
109
Voted
FUIN
2008
14 years 11 months ago
2008
The abstraction inherent in most specifications and the need to specify nondeterministic programs are two well-known sources of nondeterminism in formal specifications. In this pap...
107
click to vote
ISNN
2005
Springer
15 years 6 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
93
Voted
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
Shape analyses (Chase et al. 1990, Sagiv et al. 2002) discover properties of dynamic and/or mutable structures. We ask, "Is there an equivalent to shape analysis for purely fu...
104
Voted
POPL
2010
ACM
15 years 10 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...