Sciweavers

514 search results - page 24 / 103
» Dependency Analysis of Ada Programs
Sort
View
CONCUR
2007
Springer
14 years 1 months ago
Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures
We present a fixpoint-based algorithm for context-sensitive interprocedural kill/gen-analysis of programs with thread creation. Our algorithm is precise up to abstraction of sync...
Peter Lammich, Markus Müller-Olm
ICASSP
2008
IEEE
14 years 1 months ago
Blind separation of non-negative sources by convex analysis: Effective method using linear programming
We recently reported a criterion for blind separation of non-negative sources, using a new concept called convex analysis for mixtures of non-negative sources (CAMNS). Under some ...
Tsung-Han Chan, Wing-Kin Ma, Chong-Yung Chi, Yue W...
LREC
2010
144views Education» more  LREC 2010»
13 years 8 months ago
Inferring Syntactic Rules for Word Alignment through Inductive Logic Programming
This paper presents and evaluates an original approach to automatically align bitexts at the word level. It relies on a syntactic dependency analysis of the source and target text...
Sylwia Ozdowska, Vincent Claveau
TPDS
1998
157views more  TPDS 1998»
13 years 7 months ago
A Compiler Optimization Algorithm for Shared-Memory Multiprocessors
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory multiprocessors. The algorithm considers data locality, parall...
Kathryn S. McKinley
POPL
2009
ACM
14 years 8 months ago
Semi-sparse flow-sensitive pointer analysis
Pointer analysis is a prerequisite for many program analyses, and the effectiveness of these analyses depends on the precision of the pointer information they receive. Two major a...
Ben Hardekopf, Calvin Lin