1291 search results - page 44 / 259 » Arithmetic program paths |
MEMOCODE
2003
IEEE
14 years 1 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...
ICSE
2007
IEEE-ACM
14 years 8 months ago
2007
IEEE-ACM
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Compact and high-speed hardware architectures and logic optimization methods for the AES algorithm Rijndael are described. Encryption and decryption data paths are combined and all...
AMAI
1999
Springer
13 years 8 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...