Sciweavers

1111 search results - page 163 / 223
» Program Analysis as Model Checking of Abstract Interpretatio...
Sort
View
IFIP
2004
Springer
15 years 8 months ago
Complementing Computational Protocol Analysis with Formal Specifications
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...
112
Voted
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 8 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
132
Voted
DAGSTUHL
2003
15 years 4 months ago
Components, Features, and Agents in the ABC
Abstract. In this paper, we show how the concepts of objects, components, features and agents are used today in the Agent Building Center (ABC) environment in order to marry the mo...
Tiziana Margaria
CASSIS
2004
Springer
15 years 8 months ago
History-Based Access Control and Secure Information Flow
Abstract. This paper addresses the problem of static checking of programs to ensure that they satisfy confidentiality policies in the presence of dynamic access control in the for...
Anindya Banerjee, David A. Naumann
IEEEPACT
2009
IEEE
15 years 9 months ago
Interprocedural Load Elimination for Dynamic Optimization of Parallel Programs
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...
Rajkishore Barik, Vivek Sarkar