Sciweavers

4036 search results - page 493 / 808
» Formal Methods
Sort
View
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 1 months ago
Verifying Information Flow Control over Unbounded Processes
Abstract. Decentralized Information Flow Control (DIFC) systems enable programmers to express a desired DIFC policy, and to have the policy enforced via a reference monitor that re...
William R. Harris, Nicholas Kidd, Sagar Chaki, Som...
FM
2009
Springer
92views Formal Methods» more  FM 2009»
16 years 1 months ago
Field-Sensitive Value Analysis by Field-Insensitive Analysis
Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
SFM
2009
Springer
150views Formal Methods» more  SFM 2009»
16 years 1 months ago
Contract-Based Discovery and Composition of Web Services
In the context of Service Oriented Computing behavioural contracts are descriptions of the observable message-passing behaviour of services. In other terms, contracts are behaviour...
Mario Bravetti, Gianluigi Zavattaro
IPPS
2008
IEEE
16 years 1 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
CAV
2007
Springer
104views Hardware» more  CAV 2007»
16 years 26 days ago
Revamping TVLA: Making Parametric Shape Analysis Competitive
Abstract. TVLA is a parametric framework for shape analysis that can be easily instantiated to create different kinds of analyzers for checking properties of programs that use link...
Igor Bogudlov, Tal Lev-Ami, Thomas W. Reps, Mooly ...