929 search results - page 34 / 186 » Execution architectures for program algebra |
140
click to vote
SAS
1992
Springer
15 years 3 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
ASPLOS
2008
ACM
15 years 1 months ago
2008
ACM
The C programming language is at least as well known for its absence of spatial memory safety guarantees (i.e., lack of bounds checking) as it is for its high performance. C'...
108
click to vote
MEMOCODE
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
130
click to vote
TVLSI
2010
14 years 6 months ago
2010
Program code in a computer system can be altered either by malicious security attacks or by various faults in microprocessors. At the instruction level, all code modifications are ...
111
click to vote
VLSI
2010
Springer
14 years 6 months ago
2010
Springer
Future systems will have to support multiple and concurrent dynamic compute-intensive applications, while respecting real-time and energy consumption constraints. To overcome these...