Sciweavers

8132 search results - page 122 / 1627
» Dependability, Abstraction, and Programming
Sort
View
MP
2007
145views more  MP 2007»
15 years 6 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
JUCS
2006
92views more  JUCS 2006»
15 years 6 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
ICALP
2010
Springer
15 years 8 months ago
Example-Guided Abstraction Simplification
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
Roberto Giacobazzi, Francesco Ranzato
MICRO
1999
IEEE
136views Hardware» more  MICRO 1999»
15 years 10 months ago
Read-After-Read Memory Dependence Prediction
: We identify that typical programs exhibit highly regular read-after-read (RAR) memory dependence streams. We exploit this regularity by introducing read-after-read (RAR) memory d...
Andreas Moshovos, Gurindar S. Sohi
CADE
2009
Springer
16 years 1 months ago
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
Shuvendu K. Lahiri, Shaz Qadeer