Sciweavers

76 search results - page 4 / 16
» Comparing Completeness Properties of Static Analyses and The...
Sort
View
OOPSLA
2009
Springer
14 years 2 months ago
Static extraction and conformance analysis of hierarchical runtime architectural structure using annotations
An object diagram makes explicit the object structures that are only implicit in a class diagram. An object diagram may be missing and must extracted from the code. Alternatively,...
Marwan Abi-Antoun, Jonathan Aldrich
CAV
2005
Springer
127views Hardware» more  CAV 2005»
14 years 1 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
APLAS
2005
ACM
14 years 1 months ago
Abstract Dependences for Alarm Diagnosis
Dependences for Alarm Diagnosis Xavier Rival ´Ecole Normale Sup´erieure 45, rue d’Ulm, 75230, Paris cedex 5, France We propose a framework for dependence analyses, adapted –a...
Xavier Rival
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...