Abstract. This paper reports on the development of a finite state system for finding grammar errors without actually specifying the error. A corpus of Swedish text written by chi...
Sylvana Sofkova Hashemi, Robin Cooper, Robert Ande...
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...