Sciweavers

1452 search results - page 77 / 291
» Algorithmic Analysis of Array-Accessing Programs
Sort
View
PLDI
2011
ACM
13 years 2 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in ā€œregularā€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
ESOP
1994
Springer
14 years 3 months ago
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
Torben Amtoft
SCAM
2007
IEEE
14 years 5 months ago
Extending Attribute Grammars with Collection Attributes--Evaluation and Applications
Collection attributes, as deļ¬ned by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of v...
Eva Magnusson, Torbjörn Ekman, Görel Hed...
CSMR
2004
IEEE
14 years 2 months ago
Source Code Modularization Using Lattice of Concept Slices
Most legacy systems have been altered due to prolonged maintenance to the point that they deviate significantly from their original and intended design and consequently, they lack...
Raihan Al-Ekram, Kostas Kontogiannis
CONCUR
2005
Springer
14 years 4 months ago
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models...
Ahmed Bouajjani, Markus Müller-Olm, Tayssir T...