Sciweavers

SAS
2004
Springer
14 years 24 days ago
The Octahedron Abstract Domain
hedron Abstract Domain Robert Claris´o and Jordi Cortadella Universitat Polit`ecnica de Catalunya Barcelona, Spain Abstract. An interesting area in static analysis is the study of...
Robert Clarisó, Jordi Cortadella
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
14 years 24 days ago
Information Flow Analysis in Logical Form
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
Torben Amtoft, Anindya Banerjee
SAS
2004
Springer
14 years 24 days ago
On Logics of Aliasing
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
Marius Bozga, Radu Iosif, Yassine Lakhnech
ITRUST
2004
Springer
14 years 24 days ago
The Use of Formal Methods in the Analysis of Trust (Position Paper)
Security and trust are two properties of modern computing systems that are the focus of much recent interest. They play an increasingly significant role in the requirements for mo...
Michael J. Butler, Michael Leuschel, Stépha...
ESORICS
2004
Springer
14 years 25 days ago
A Formalization of Anonymity and Onion Routing
The use of formal methods to verify security protocols with respect to secrecy and authentication has become standard practice. In contrast, the formalization of other security goa...
Sjouke Mauw, Jan Verschuren, Erik P. de Vink
CAV
2004
Springer
93views Hardware» more  CAV 2004»
14 years 25 days ago
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures
—We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and pre...
Farn Wang
CAV
2004
Springer
120views Hardware» more  CAV 2004»
14 years 25 days ago
Termination of Linear Programs
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
Ashish Tiwari
CAV
2004
Springer
99views Hardware» more  CAV 2004»
14 years 25 days ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...
CAV
2004
Springer
202views Hardware» more  CAV 2004»
14 years 25 days ago
Statistical Model Checking of Black-Box Probabilistic Systems
Abstract. We propose a new statistical approach to analyzing stochastic systems against specifications given in a sublogic of continuous stochastic logic (CSL). Unlike past numeri...
Koushik Sen, Mahesh Viswanathan, Gul Agha
CAV
2004
Springer
87views Hardware» more  CAV 2004»
14 years 25 days ago
GSTE Is Partitioned Model Checking
Verifying whether an ω-regular property is satisfied by a finite-state system is a core problem in model checking. Standard techniques build an automaton with the complementary ...
Roberto Sebastiani, Eli Singerman, Stefano Tonetta...