1111 search results - page 85 / 223 » Program Analysis as Model Checking of Abstract Interpretatio... |
236
Voted
AMW
2011
14 years 7 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...
131
click to vote
SPIN
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
124
click to vote
SPIN
2010
Springer
15 years 1 months ago
2010
Springer
This paper addresses the problem of verifying programs for the relaxed memory models implemented in modern processors. Specifically, it considers the TSO (Total Store Order) relax...
150
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
115
click to vote
FOAL
2008
ACM
15 years 5 months ago
2008
ACM
Often, insertion of several aspects into one system is desired and in that case the problem of interference among the different aspects might arise, even if each aspect individual...