1320 search results - page 102 / 264 » Efficient Implementation of a Linear Logic Programming Langu... |
148
Voted
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
191
click to vote
ICLP
2011
Springer
14 years 7 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
183
Voted
IFIP
2010
Springer
14 years 10 months ago
2010
Springer
Modern embedded systems are often heterogeneous in that their design requires several description paradigms, based on different models of computation and concurrency (MoCCs). In th...
128
Voted
SIGSOFT
2004
ACM
16 years 4 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
143
click to vote
POPL
2012
ACM
13 years 11 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...