Sciweavers

63 search results - page 6 / 13
» A Comparative Study of Logic Programs with Preference
Sort
View
AGP
1999
IEEE
13 years 11 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
CGO
2008
IEEE
14 years 1 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
IISWC
2008
IEEE
14 years 1 months ago
Energy-aware application scheduling on a heterogeneous multi-core system
Heterogeneous multi-core processors are attractive for power efficient computing because of their ability to meet varied resource requirements of diverse applications in a workloa...
Jian Chen, Lizy Kurian John
AMAST
2004
Springer
14 years 26 days ago
Formal JVM Code Analysis in JavaFAN
JavaFAN uses a Maude rewriting logic specification of the JVM semantics as the basis of a software analysis tool with competitive performance. It supports formal analysis of concu...
Azadeh Farzan, José Meseguer, Grigore Rosu
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
Finding sequence motifs with Bayesian models incorporating positional information: an application to transcription factor bindin
Background: Biologically active sequence motifs often have positional preferences with respect to a genomic landmark. For example, many known transcription factor binding sites (T...
Nak-Kyeong Kim, Kannan Tharakaraman, Leonardo Mari...