22 search results - page 3 / 5 » fossacs 2008 |
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...