Sciweavers

12670 search results - page 205 / 2534
» Requirements Modeling
Sort
View
CAV
2004
Springer
126views Hardware» more  CAV 2004»
15 years 7 months ago
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
Model checking algorithms can report a property as being true for reasons that may be considered vacuous. Current algorithms for detecting vacuity require either checking a quadrat...
Kedar S. Namjoshi
156
Voted
MODELS
2010
Springer
15 years 2 months ago
Automatically Discovering Properties That Specify the Latent Behavior of UML Models
Formal analysis can be used to verify that a model of the system adheres to its requirements. As such, traditional formal analysis focuses on whether known (desired) system propert...
Heather Goldsby, Betty H. C. Cheng
134
Voted
UM
2001
Springer
15 years 8 months ago
User Modelling in I-Help: What, Why, When and How
This paper describes user modelling in I-Help, a system to facilitate communication amongst learners. There are two I-Help components: Private and Public Discussions. In the Privat...
Susan Bull, Jim E. Greer, Gordon I. McCalla, Lori ...
SAC
2009
ACM
15 years 10 months ago
LTS semantics for use case models
Formalization is a necessary precondition for the specification of precise and unambiguous use case models, which serve as reference points for the design and implementation of so...
Daniel Sinnig, Patrice Chalin, Ferhat Khendek
135
Voted
ICALP
1997
Springer
15 years 7 months ago
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, tha...
Olaf Burkart, Bernhard Steffen