3169 search results - page 102 / 634 » Robust Timed Automata |
101
Voted
TACS
2001
Springer
15 years 7 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
134
Voted
GRAMMARS
2000
15 years 2 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...
CORR
2010
Springer
14 years 12 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...
119
click to vote
IJFCS
2006
15 years 2 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...
112
Voted
FM
2006
Springer
15 years 6 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...