Sciweavers

34 search results - page 6 / 7
» Symbolic Reachability Analysis Based on SAT-Solvers
Sort
View
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 1 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
FORTE
2009
13 years 5 months ago
Approximated Context-Sensitive Analysis for Parameterized Verification
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
ASPDAC
2001
ACM
126views Hardware» more  ASPDAC 2001»
13 years 11 months ago
A new partitioning scheme for improvement of image computation
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
Christoph Meinel, Christian Stangier
SEFM
2005
IEEE
14 years 1 months ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
SAS
1999
Springer
13 years 11 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...