Sciweavers

714 search results - page 95 / 143
» Certifying Model Checkers
Sort
View
ICFEM
2010
Springer
13 years 6 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...
KESAMSTA
2010
Springer
13 years 6 months ago
Modeling and Verifying Business Interactions via Commitments and Dialogue Actions
A variety of business interactions in open environments can be captured in terms of creation and manipulation of social commitments among the agents. Such interactions include B2B ...
Mohamed El-Menshawy, Jamal Bentahar, Rachida Dssou...
FMCAD
2004
Springer
14 years 1 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
FIW
2007
133views Communications» more  FIW 2007»
13 years 9 months ago
Conflict Detection in Call Control Using First-Order Logic Model Checking
Feature interaction detection methods, whether online or offline, depend on previous knowledge of conflicts between the actions executed by the features. This knowledge is usually ...
Ahmed F. Layouni, Luigi Logrippo, Kenneth J. Turne...
JAR
2008
70views more  JAR 2008»
13 years 7 months ago
Assumption-Commitment Support for CSP Model Checking
We present a simple formulation of Assumption-Commitment reasoning using CSP. In our formulation, an assumption-commitment style property of a process SYS takes the form COM SYS A...
Nick Moffat, Michael Goldsmith