Sciweavers

1715 search results - page 152 / 343
» Domain-Specific Program Checking
Sort
View
ATVA
2004
Springer
135views Hardware» more  ATVA 2004»
14 years 3 months ago
Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors
Data races do not cover all kinds of concurrency errors. This paper presents a data-ow-based technique to nd stale-value errors, which are not found by low-level and high-level d...
Cyrille Artho, Klaus Havelund, Armin Biere
ICALP
2003
Springer
14 years 3 months ago
Resource Access and Mobility Control with Dynamic Privileges Acquisition
µKlaim is a process language that permits programming distributed systems made up of several mobile components interacting through multiple distributed tuple spaces. We present th...
Daniele Gorla, Rosario Pugliese
APLAS
2007
ACM
14 years 2 months ago
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
Alwen Tiu
APLAS
2007
ACM
14 years 2 months ago
Type-Based Verification of Correspondence Assertions for Communication Protocols
Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called a...
Daisuke Kikuchi, Naoki Kobayashi
CAV
2010
Springer
198views Hardware» more  CAV 2010»
14 years 2 months ago
Termination Analysis with Compositional Transition Invariants
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...