1204 search results - page 132 / 241 » Termination of Polynomial Programs |
199
Voted
AMW
2011
14 years 4 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
134
Voted
CONCUR
2011
Springer
14 years 16 days 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...
148
click to vote
POPL
1989
ACM
15 years 4 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
143
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
92
Voted
DSN
2004
IEEE
15 years 4 months ago
2004
IEEE
We concentrate on automated synthesis of multitolerant programs, i.e., programs that tolerate multiple classes of faults and provide a (possibly) different level of fault-toleranc...