3229 search results - page 57 / 646 » The Theory of Timed Automata |
NORDSEC
2009
Springer
14 years 4 months ago
2009
Springer
Runtime enforcement is a common mechanism for ensuring that program executions adhere to constraints specified by a security policy. It is based on two simple ideas: the enforceme...
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
Concurrent compositions of recursive programs with finite a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form ...
TACAS
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
POPL
2002
ACM
14 years 10 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...