2911 search results - page 469 / 583 » A Logic of Graph Constraints |
197
Voted
POPL
2008
ACM
16 years 29 days ago
2008
ACM
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
69
Voted
ICCAD
2007
IEEE
15 years 9 months ago
2007
IEEE
—This work proposes a new yield computation technique dedicated to HLS, which is an essential component in timing variationaware HLS research field. The SSTAs used by the curren...
98
Voted
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
107
click to vote
ESOP
2004
Springer
15 years 6 months ago
2004
Springer
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
102
Voted
INFFUS
2006
15 years 19 days ago
2006
The bipolar view in preference modeling distinguishes between negative and positive preferences. Negative preferences correspond to what is rejected, considered unacceptable, whil...