10707 search results - page 149 / 2142 » Designing executable abstractions |
93
Voted
MEMOCODE
2005
IEEE
15 years 9 months ago
2005
IEEE
We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We de...
133
Voted
ESOP
2004
Springer
15 years 8 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...
130
click to vote
CGO
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Online optimization allows the continuous restructuring and adaptation of an executing application using live information about its execution environment. The further ad...
137
click to vote
REX
1990
15 years 7 months ago
1990
Data Types William R. Cook Hewlett-Packard Laboratories 1501 Page Mill Road, Palo Alto, CA, 94303-0969, USA Abstract: This tutorial collects and elaborates arguments for distinguis...
205
Voted
ISOLA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...