7988 search results - page 65 / 1598 » A Useful Undecidable Theory |
CSL
2009
Springer
14 years 3 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
ATVA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
RTA
2007
Springer
14 years 3 months ago
2007
Springer
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
CAV
2003
Springer
14 years 2 months ago
2003
Springer
We consider the problem of synthesizing controllers for timed systems modeled using timed automata. The point of departure from earlier work is that we consider controllers that ha...