Sciweavers

1422 search results - page 99 / 285
» Complementation in Abstract Interpretation
Sort
View
CC
2008
Springer
137views System Software» more  CC 2008»
15 years 6 months ago
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis
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...
Francesco Logozzo, Manuel Fähndrich
ICFP
2005
ACM
16 years 4 months ago
Recursive type generativity
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 ...
Derek Dreyer
LICS
2009
IEEE
15 years 11 months ago
Substructural Operational Semantics as Ordered Logic Programming
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...
Frank Pfenning, Robert J. Simmons
LOPSTR
2009
Springer
15 years 11 months ago
Towards Just-In-Time Partial Evaluation of Prolog
Abstract. We introduce a just-in-time specializer for Prolog. Just-intime specialization attempts to unify of the concepts and benefits of partial evaluation (PE) and just-in-time...
Carl Friedrich Bolz, Michael Leuschel, Armin Rigo
ICANN
2007
Springer
15 years 10 months ago
Generalized Softmax Networks for Non-linear Component Extraction
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 ...
Jörg Lücke, Maneesh Sahani