212 search results - page 21 / 43 » Completeness and Complexity of Bounded Model Checking |
154
click to vote
DLOG
2006
15 years 3 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...
120
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
107
click to vote
ACSD
2003
IEEE
15 years 5 months ago
2003
IEEE
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
105
click to vote
FSTTCS
2004
Springer
15 years 7 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...