756 search results - page 27 / 152 » Can Abstract State Machines Be Useful in Language Theory |
OOPSLA
2004
Springer
14 years 1 months ago
2004
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint exis that the abstract state of the object to whi...
ATAL
2004
Springer
13 years 11 months ago
2004
Springer
We have developed a set of tools to allow the use of model-checking techniques for the verification of systems directly implemented in an agent-oriented programming language. The ...
FCT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. In earlier work, the Abstract State Machine Thesis — that arbitrary algore behaviorally equivalent to abstract state machines — was established for several classes of...
MLG
2007
Springer
14 years 2 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...