Sciweavers

181 search results - page 2 / 37
» Testable Use Cases in the Abstract State Machine Language
Sort
View
DLT
2006
13 years 8 months ago
Can Abstract State Machines Be Useful in Language Theory?
ract State Machines Be Useful in Language Theory? Yuri Gurevich a Margus Veanes a Charles Wallace b aMicrosoft Research, Redmond, Washington, USA bMichigan Tech, Houghton, Michigan...
Yuri Gurevich, Charles Wallace
UML
2005
Springer
14 years 15 days ago
Specifying Precise Use Cases with Use Case Charts
Use cases are a popular method for capturing and structuring software requirements. The informality of use cases is both a blessing and a curse. It enables easy application and lea...
Jon Whittle
ICFEM
2005
Springer
14 years 16 days ago
29 New Unclarities in the Semantics of UML 2.0 State Machines
Abstract. UML 2.0, which is the standard modeling language for objectoriented systems, has only an informally given semantics. This is in particular the case for UML 2.0 state mach...
Harald Fecher, Jens Schönborn, Marcel Kyas, W...
LATA
2011
Springer
12 years 10 months ago
Classifying Regular Languages via Cascade Products of Automata
Abstract. Building on the celebrated Krohn-Rhodes Theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those c...
Marcus Gelderie
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
13 years 10 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira