Sciweavers

191 search results - page 21 / 39
» Generating Heap-Bounded Programs in a Functional Setting
Sort
View
POPL
2010
ACM
14 years 5 months ago
Dependent Types from Counterexamples
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...
Tachio Terauchi
IPPS
1998
IEEE
13 years 12 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
TII
2010
166views Education» more  TII 2010»
13 years 2 months ago
Source-to-Source Architecture Transformation for Performance Optimization in BIP
Behavior, Interaction, Priorities (BIP) is a component framework for constructing systems from a set of atomic components by using two kinds of composition operators: interactions ...
Marius Bozga, Mohamad Jaber, Joseph Sifakis
CHARME
2003
Springer
100views Hardware» more  CHARME 2003»
14 years 27 days ago
Inductive Assertions and Operational Semantics
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
J. Strother Moore
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 7 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...