Sciweavers

437 search results - page 65 / 88
» Proving Termination by Divergence
Sort
View
SP
2008
IEEE
134views Security Privacy» more  SP 2008»
13 years 7 months ago
Expressive Declassification Policies and Modular Static Enforcement
This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed...
Anindya Banerjee, David A. Naumann, Stan Rosenberg
LOGCOM
2007
126views more  LOGCOM 2007»
13 years 7 months ago
A Structural Proof of the Soundness of Rely/guarantee Rules
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...
Joey W. Coleman, Cliff B. Jones
TCS
2010
13 years 6 months ago
On the computational power of BlenX
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
Alessandro Romanel, Corrado Priami
VSTTE
2010
Springer
13 years 5 months ago
Reusable Verification of a Copying Collector
Garbage collectors are very hard to implement correctly due to their low-level manipulation of memory. In this paper, we construct a copying garbage collector which we have proved ...
Magnus O. Myreen
CAV
2012
Springer
334views Hardware» more  CAV 2012»
11 years 10 months ago
Joogie: Infeasible Code Detection for Java
We present Joogie, a tool that detects infeasible code in Java programs. Infeasible code is code that does not occur on feasible controlflow paths and thus has no feasible executi...
Stephan Arlt, Martin Schäf