1410 search results - page 248 / 282 » A Logic for Virtual Memory |
121
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
146
click to vote
NCA
2007
IEEE
15 years 10 months ago
2007
IEEE
Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that such services deal with dynamically changing membership and...
114
click to vote
CONCUR
2007
Springer
15 years 10 months ago
2007
Springer
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
119
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
127
click to vote
DAC
2006
ACM
15 years 10 months ago
2006
ACM
Silicon design implementation has become increasingly complex with the deep submicron technologies such as 90nm and below. It is common to see multiple processor cores, several ty...