3342 search results - page 206 / 669 » Automating Abstract Interpretation |
ICLP
1999
Springer
15 years 3 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
CASSIS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Abstract interpretation is a particularly well-suited methodology to build modular correctness proof of static analysers. Proof modularity becomes essential when correctn...
CC
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...
ICFP
2005
ACM
15 years 11 months ago
2005
ACM
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...
ICANN
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We develop a probabilistic interpretation of non-linear component extraction in neural networks that activate their hidden units according to a softmaxlike mechanism. On ...