1833 search results - page 245 / 367 » Mechanized Verification with Sharing |
192
click to vote
DC
2010
15 years 6 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
174
click to vote
ENTCS
2008
15 years 6 months ago
2008
Emerging architectures such as partially reconfigurable FPGAs provide a huge potential for adaptivity in the area of embedded systems. Since many system functions are only execute...
200
click to vote
ENTCS
2006
15 years 6 months ago
2006
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...
184
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
202
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...