222 search results - page 17 / 45 » Subject Reduction of Logic Programs as Proof-Theoretic Prope... |
ASPLOS
2011
ACM
12 years 11 months ago
2011
ACM
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
ISSTA
2012
ACM
11 years 10 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
CSL
2004
Springer
14 years 27 days ago
2004
Springer
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
TOPLAS
2002
13 years 7 months ago
2002
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
TLDI
2005
ACM
14 years 1 months ago
2005
ACM
Atomicity is a fundamental correctness property in multithreaded programs. This paper presents an algorithm for verifying atomicity via type inference. The underlying type system ...