Sciweavers

SAS
1999
Springer
116views Formal Methods» more  SAS 1999»
13 years 8 months ago
Decomposing Non-redundant Sharing by Complementation
Complementation, the inverse of the reduced product operation, is a technique for systemfinding minimal decompositions of abstract domains. Fil´e and Ranzato advanced the state ...
Enea Zaffanella, Patricia M. Hill, Roberto Bagnara
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
13 years 8 months ago
Translating Out of Static Single Assignment Form
Programs represented in Static Single Assignment (SSA) form contain phi instructions (or functions) whose operational semantics are to merge values coming from distinct control flo...
Vugranam C. Sreedhar, Roy Dz-Ching Ju, David M. Gi...
SAS
1999
Springer
117views Formal Methods» more  SAS 1999»
13 years 8 months ago
Abstracting Cryptographic Protocols with Tree Automata
ing Cryptographic Protocols with Tree Automata David Monniaux http://www.di.ens.fr/%7Fmonniaux, Laboratoire d’Informatique, ´Ecole Normale Sup´erieure, 45 rue d’Ulm , 75230 P...
David Monniaux
SAS
1999
Springer
113views Formal Methods» more  SAS 1999»
13 years 8 months ago
Model-Checking: A Tutorial Introduction
Markus Müller-Olm, David A. Schmidt, Bernhard...
SAS
1999
Springer
13 years 8 months ago
Binary Decision Graphs
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
Laurent Mauborgne
SAS
1999
Springer
107views Formal Methods» more  SAS 1999»
13 years 8 months ago
Abstract Interpretation of Mobile Ambients
René Rydhof Hansen, Jacob Grydholt Jensen, ...
SAS
1999
Springer
13 years 8 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
SAS
1999
Springer
124views Formal Methods» more  SAS 1999»
13 years 8 months ago
State Space Reduction Based on Live Variables Analysis
The intrinsic complexity of most protocol speci cations in particular, and of asynchronous systems in general, lead us to study combinations of static analysis with classical model...
Marius Bozga, Jean-Claude Fernandez, Lucian Ghirvu
SAS
1999
Springer
13 years 8 months ago
Polyhedral Analysis for Synchronous Languages
We define an operational semantics for the Signal language and design an analysis which allows to verify properties pertaining to the relation between values of the numeric and bo...
Frédéric Besson, Thomas P. Jensen, J...
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
13 years 8 months ago
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
This paper presents and evaluates a set of analyses designed to reduce synchronization overhead in Java programs. Monitor-based synchronization in Java often causes significant ove...
Jonathan Aldrich, Craig Chambers, Emin Gün Si...