2490 search results - page 66 / 498 » Complexity of Contextual Reasoning |
169
click to vote
CONCUR
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
107
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
126
click to vote
PODS
2007
ACM
16 years 4 months ago
2007
ACM
XML and semi-structured data are now de-facto standards for data exchange, and it is often the case that published or exchanged XML documents have specic restrictions on how they ...
148
click to vote
ICRA
2009
IEEE
15 years 10 months ago
2009
IEEE
— An autonomous robot system that is to act in a real-world environment is faced with the problem of having to deal with a high degree of both complexity as well as uncertainty. ...
147
click to vote
LFCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...