Sciweavers

641 search results - page 7 / 129
» Identifying Contingency Requirements Using Obstacle Analysis
Sort
View
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
14 years 29 days ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
13 years 11 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...
ECRTS
2003
IEEE
14 years 23 days ago
Establishing Timing Requirements and Control Attributes for Control Loops in Real-Time Systems
Advances in scheduling theory have given designers of control systems greater flexibility over their choice of timing requirements. This could lead to systems becoming more respon...
Iain Bate, Peter Nightingale, Anton Cervin
FMICS
2008
Springer
13 years 9 months ago
Formal Verification of the Implementability of Timing Requirements
There has been relatively little work on the implementability of timing requirements. We have previously provided definitions of fundamental timing operators that explicitly consid...
Xiayong Hu, Mark Lawford, Alan Wassyng
IADIS
2003
13 years 8 months ago
Requirements for Groupware Calendar Systems (GCS): Addressing Social Relationships
This paper challenges the generic single conceptual viewpoint that designers have of groupware and specifically Groupware Calendar Systems (GCS). From the analysis of interviews, ...
Sungmin Park, Howard Harris, Patricia Crosbie