Sciweavers

4340 search results - page 589 / 868
» Formal Methods and Cryptography
Sort
View
DALT
2009
Springer
16 years 1 months ago
Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming
In this paper, we investigate the multiagent planning problem in the presence of cooperative actions and agents, which have their own goals and are willing to cooperate. To this en...
Tran Cao Son, Chiaki Sakama
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 1 months ago
A Metric Encoding for Bounded Model Checking
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
16 years 1 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
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...