Sciweavers

2477 search results - page 88 / 496
» Parallelizing Functional Programs by Generalization
Sort
View
JLP
2007
114views more  JLP 2007»
14 years 9 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
TAPSOFT
1997
Springer
15 years 1 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
FPL
2009
Springer
79views Hardware» more  FPL 2009»
15 years 2 months ago
A reconfigurable architecture for the Phylogenetic Likelihood Function
As FPGA devices become larger, more coarse-grain modules coupled with large scale reconfigurable fabric become available, thus enabling new classes of applications to run effici...
Nikolaos Alachiotis, Alexandros Stamatakis, Euripi...
ENTCS
2006
137views more  ENTCS 2006»
14 years 9 months ago
Coalgebraic Description of Generalized Binary Methods
We extend the Reichel-Jacobs coalgebraic account of specification and refinement of objects and classes in Object Oriented Programming to (generalized) binary methods. These are m...
Furio Honsell, Marina Lenisa, Rekha Redamalla
SIAMMAX
2010
105views more  SIAMMAX 2010»
14 years 4 months ago
Construction of Covariance Matrices with a Specified Discrepancy Function Minimizer, with Application to Factor Analysis
The main goal of this paper is to develop a numerical procedure for construction of covariance matrices such that for a given covariance structural model and a discrepancy function...
So Yeon Chun, A. Shapiro