Sciweavers

6608 search results - page 6 / 1322
» On the Completeness of Model Checking
Sort
View
ENTCS
2007
107views more  ENTCS 2007»
13 years 7 months ago
Modeling Environment for Component Model Checking from Hierarchical Architecture
Application of model checking to isolated software components is not directly possible because a component does not form a complete program - the problem of missing environment oc...
Pavel Parizek, Frantisek Plasil
ATVA
2007
Springer
101views Hardware» more  ATVA 2007»
13 years 11 months ago
On-the-Fly Model Checking of Fair Non-repudiation Protocols
A fair non-repudiation protocol should guarantee, (1) when a sender sends a message to a receiver, neither the sender nor the receiver can deny having participated in this communic...
Guoqiang Li, Mizuhito Ogawa
COMPSAC
2003
IEEE
14 years 20 days ago
Automating Checking of Models Built Using a Graphically Based Formal Modelling Language
RDT is a graphical formal modelling language in which the modeller works by constructing diagrams of the processes in their model which they then join together to form complete sy...
Robert John Walters
CAV
2012
Springer
222views Hardware» more  CAV 2012»
11 years 9 months ago
Leveraging Interpolant Strength in Model Checking
Craig interpolation is a well known method of abstraction successfully used in both hardware and software model checking. The logical strength of interpolants can affect the quali...
Simone Fulvio Rollini, Ondrej Sery, Natasha Sharyg...
ENTCS
2007
141views more  ENTCS 2007»
13 years 7 months ago
Compressing BMC Encodings with QBF
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
Toni Jussila, Armin Biere