1246 search results - page 106 / 250 » Recursive Timed Automata |
174
click to vote
GRAMMARS
2000
15 years 6 months ago
2000
Abstract. We propose a modular design of tabular parsing algorithms for treeadjoining languages. The modularity is made possible by a separation of the parsing strategy from the me...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-autom...
168
click to vote
IJFCS
2006
15 years 6 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
150
click to vote
FM
2006
Springer
15 years 10 months ago
2006
Springer
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
192
click to vote
VMCAI
2010
Springer
16 years 1 months ago
2010
Springer
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...