Sciweavers

3671 search results - page 520 / 735
» On Garbage and Program Logic
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 3 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
ENTCS
2008
73views more  ENTCS 2008»
15 years 6 months ago
Oracle-Based Partial Evaluation
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...
Claudio Ochoa, Germán Puebla
CEC
2011
IEEE
14 years 6 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
ISCA
2000
IEEE
103views Hardware» more  ISCA 2000»
15 years 10 months ago
Circuits for wide-window superscalar processors
Our program benchmarks and simulations of novel circuits indicate that large-window processors are feasible. Using our redesigned superscalar components, a large-window processor ...
Dana S. Henry, Bradley C. Kuszmaul, Gabriel H. Loh...
CADE
1998
Springer
15 years 10 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...