756 search results - page 52 / 152 » Can Abstract State Machines Be Useful in Language Theory |
230
click to vote
ECEASST
2010
15 years 3 months ago
2010
Abstract: Graphical user interfaces (GUIs) are critical components of todays software. Given their increased relevance, correctness and usability of GUIs are becoming essential. Th...
180
click to vote
IFIP
2010
Springer
15 years 13 days ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
146
Voted
AAAI
1994
15 years 7 months ago
1994
We present a formal theory of model-based testing, an algorithm for test generation based on it, and outline how testing is implemented by a diagnostic engine. The key to making t...
154
Voted
SAS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
143
click to vote
CAV
1999
Springer
15 years 10 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...