1379 search results - page 111 / 276 » Dynamic Program Slicing in Understanding of Program Executio... |
155
Voted
ICDCS
1991
IEEE
15 years 10 months ago
1991
IEEE
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
141
click to vote
LFP
1990
15 years 7 months ago
1990
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
170
click to vote
ICSE
2010
IEEE-ACM
15 years 11 months ago
2010
IEEE-ACM
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
168
click to vote
AOSD
2009
ACM
15 years 8 months ago
2009
ACM
Cyber-physical systems increasingly rely on dynamically adaptive programs to respond to changes in their physical environment; examples include ecosystem monitoring and disaster r...
186
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Modern architectures implement relaxed memory models which may reorder memory operations or execute them non-atomically. Special instructions called memory fences are provided, al...