Sciweavers

1204 search results - page 114 / 241
» Termination of Polynomial Programs
Sort
View
SIGSOFT
2005
ACM
16 years 1 months ago
Applying classification techniques to remotely-collected program execution data
There is an increasing interest in techniques that support measurement and analysis of fielded software systems. One of the main goals of these techniques is to better understand ...
Murali Haran, Alan F. Karr, Alessandro Orso, Adam ...
89
Voted
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
15 years 9 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
VMCAI
2009
Springer
15 years 7 months ago
An Abort-Aware Model of Transactional Programming
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
Kousha Etessami, Patrice Godefroid
CONCUR
2005
Springer
15 years 6 months ago
Concurrent Clustered Programming
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
Vijay A. Saraswat, Radha Jagadeesan
ICS
2010
Tsinghua U.
15 years 4 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling