Sciweavers

1023 search results - page 131 / 205
» A Formal Method for Program Slicing
Sort
View
PLDI
2006
ACM
15 years 7 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
CAV
2007
Springer
173views Hardware» more  CAV 2007»
15 years 7 months ago
Array Abstractions from Proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Ranjit Jhala, Kenneth L. McMillan
LOBJET
2000
84views more  LOBJET 2000»
15 years 1 months ago
Typing Concurrent Objects and Actors
ABSTRACT. As informal methods do little to help their use for concurrent and distributed programming, one of the most challenging current tasks is to build tools based on formal me...
Fabien Dagnat, Marc Pantel, Matthias Colin, Patric...
SIGSOFT
2007
ACM
16 years 2 months ago
A behavioural model for product families
In this paper we propose a behavioural model, namely the Extended Modal Labeled Transition Systems, as a basis for the formalization of the different notions of variability usuall...
Alessandro Fantechi, Stefania Gnesi
128
Voted
WWW
2006
ACM
16 years 2 months ago
A framework for XML data streams history checking and monitoring
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
Alessandro Campi, Paola Spoletini