7988 search results - page 19 / 1598 » A Useful Undecidable Theory |
DLOG
2001
13 years 9 months ago
2001
We consider expressive Description Logics (ALCN) allowing for number restrictions on complex roles built with combinations of role constructors. In particular, we are mainly inter...
ICFP
2004
ACM
14 years 7 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We prove several results about the relations between injectivity and surjectivity for sand automata. Moreover, we begin the exploration of the dynamical behavior of sand automata ...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
POPL
2004
ACM
14 years 1 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...