Sciweavers

6274 search results - page 259 / 1255
» Proofs, Programs, Processes
Sort
View
ASIAN
2009
Springer
269views Algorithms» more  ASIAN 2009»
15 years 4 months ago
Noninterference with Dynamic Security Domains and Policies
Abstract. Language-based information flow analysis is used to statically examine a program for information flows between objects of different security domains, and to verify these ...
Robert Grabowski, Lennart Beringer
ESOP
2008
Springer
15 years 8 months ago
Inferring Channel Buffer Bounds Via Linear Programming
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
Tachio Terauchi, Adam Megacz
ECAI
2004
Springer
15 years 10 months ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
16 years 7 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
ICCCN
2007
IEEE
16 years 26 days ago
Lagniappe: Multi-* Programming Made Simple
—The emergence of multi-processor, multi-threaded architectures (referred to as multi- architectures) facilitates the design of high-throughput request processing systems (e.g., ...
Taylor L. Riché, R. Greg Lavender, Harrick ...