Sciweavers

144 search results - page 24 / 29
» Nondeterminism Analysis of Functional Logic Programs
Sort
View
SIGSOFT
2004
ACM
14 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
BMCBI
2007
130views more  BMCBI 2007»
13 years 9 months ago
Differential analysis for high density tiling microarray data
Background: High density oligonucleotide tiling arrays are an effective and powerful platform for conducting unbiased genome-wide studies. The ab initio probe selection method emp...
Srinka Ghosh, Heather A. Hirsch, Edward A. Sekinge...
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
14 years 3 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
AGP
1998
IEEE
14 years 1 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
TPLP
2002
69views more  TPLP 2002»
13 years 9 months ago
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella