Sciweavers

1757 search results - page 65 / 352
» Alternating Refinement Relations
Sort
View
90
Voted
JLP
2008
98views more  JLP 2008»
15 years 16 days ago
Comparing disjunctive modal transition systems with an one-selecting variant
models, used for specification, analysis and verification, usually describe sets of implementations by means of a refinement relation. In the branching time setting, implementatio...
Harald Fecher, Heiko Schmidt
TSE
2002
94views more  TSE 2002»
15 years 6 days ago
Behavior Protocols for Software Components
In this paper, we propose a means to enhance an architecture description language with a description of component behavior. A notation used for this purpose should be able to expr...
Frantisek Plasil, Stanislav Visnovsky
SJIS
2002
79views more  SJIS 2002»
15 years 6 days ago
Located Accountabilities in Technology Production
This paper explores the relevance of recent feminist reconstructions of objectivity for the development of alternative practices of technology production and use. I take as my sta...
Lucy A. Suchman
122
Voted
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
14 years 10 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
99
Voted
SDM
2007
SIAM
177views Data Mining» more  SDM 2007»
15 years 2 months ago
Multi-way Clustering on Relation Graphs
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Arindam Banerjee, Sugato Basu, Srujana Merugu