940 search results - page 96 / 188 » Local rely-guarantee reasoning |
113
click to vote
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
133
Voted
CL
2010
Springer
15 years 24 days ago
2010
Springer
In this paper we present the syntax, semantics, and compilation of a new system-level programming language called SystemJ. SystemJ is a multiclock language supporting the Globally...
CORR
2006
Springer
15 years 22 days ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
130
click to vote
CSL
2007
Springer
15 years 20 days ago
2007
Springer
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
115
click to vote
LICS
2010
IEEE
14 years 11 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...