9 search results - page 2 / 2 » Deciding kCFA is complete for EXPTIME |
POPL
2009
ACM
14 years 5 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
ICALP
2009
Springer
14 years 23 hour ago
2009
Springer
Abstract. We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...