6608 search results - page 36 / 1322 » On the Completeness of Model Checking |
196
Voted
CHARME
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
227
click to vote
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
131
click to vote
RTA
1995
Springer
15 years 7 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
132
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
151
click to vote
ASYNC
1997
IEEE
15 years 7 months ago
1997
IEEE
Abstract-This paper describes the design and verification of a high-performance asynchronous differential equation solver benchmark circuit. The design has low control overhead whi...