3573 search results - page 505 / 715 » Reasoning about Codata |
166
click to vote
CCS
2007
ACM
15 years 9 months ago
2007
ACM
We describe the formalization of a correctness proof for a conflict detection algorithm for firewalls in the Coq Proof Assistant. First, we give formal definitions in Coq of a fir...
150
click to vote
DASFAA
2007
IEEE
15 years 9 months ago
2007
IEEE
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
148
click to vote
DIM
2007
ACM
15 years 9 months ago
2007
ACM
In a history-based trust-management system, users and service providers use information about past transactions to make trust-based decisions concerning current transactions. One ...
142
click to vote
CAV
2010
Springer
15 years 9 months ago
2010
Springer
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
169
click to vote
CAV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...