193 search results - page 20 / 39 » Reasoning about Memory Layouts |
TLDI
2009
ACM
15 years 6 months ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
AES
2000
Springer
15 years 2 months ago
2000
Springer
We analyze the five remaining AES candidate algorithms MARS, RC6, Rijndael, Serpent, and Twofish as well as DES, Triple DES, and IDEA by examining independently developed Java imp...
ICCAD
2002
IEEE
15 years 6 months ago
2002
IEEE
The simulation of on-chip inductance using PEEC-based circuit analysis methods often requires the solution of a subproblem where an extracted inductance matrix must be multiplied ...
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
173
click to vote
COSIT
2011
Springer
13 years 9 months ago
2011
Springer
If spatial cognition hopes to understand memory of and reasoning about real-world environments, then all aspects of the environment, both spatial and non-spatial need to be conside...