Sciweavers

1127 search results - page 83 / 226
» Testing the Expansion of a Graph
Sort
View
TACAS
2004
Springer
122views Algorithms» more  TACAS 2004»
15 years 3 months ago
A Scalable Incomplete Test for the Boundedness of UML RT Models
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
Stefan Leue, Richard Mayr, Wei Wei
CHI
2010
ACM
15 years 3 months ago
FrameWire: a tool for automatically extracting interaction logic from paper prototyping tests
Paper prototyping offers unique affordances for interface design. However, due to its spontaneous nature and the limitations of paper, it is difficult to distill and communicate a...
Yang Li, Xiang Cao, Katherine Everitt, Morgan Dixo...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
15 years 10 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
JUCS
2007
95views more  JUCS 2007»
14 years 9 months ago
Using Place Invariants and Test Point Placement to Isolate Faults in Discrete Event Systems
: This paper describes a method of using Petri net P-invariants in system diagnosis. To model this process a net oriented fault classification is presented. Hence, the considered d...
Iwan Tabakow
RTCSA
1999
IEEE
15 years 2 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer