Sciweavers

506 search results - page 7 / 102
» Proving Properties about Lists Using Containers
Sort
View
ICFEM
2010
Springer
14 years 7 months ago
Reasoning about Safety and Progress Using Contracts
Designing concurrent or distributed systems with complex architectures while preserving a set of high-level requirements through all design steps is not a trivial task. Building up...
Imene Ben Hafaiedh, Susanne Graf, Sophie Quinton
WEBI
2007
Springer
15 years 3 months ago
PLF: A Publication List Web Page Finder for Researchers
Finding and keeping track of other researchers’ publication lists is an essential activity for every researcher, because they often contain citations not found elsewhere and may...
Kai-Hsiang Yang, Jen-Ming Chung, Jan-Ming Ho
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 1 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
CEFP
2009
Springer
14 years 7 months ago
Reasoning about Codata
Programmers happily use induction to prove properties of recursive programs. To show properties of corecursive programs they employ coinduction, but perhaps less enthusiastically. ...
Ralf Hinze
ENTCS
2007
129views more  ENTCS 2007»
14 years 9 months ago
Protocol Composition Logic (PCL)
Protocol Composition Logic (PCL) is a logic for proving security properties of network protocols that use public and symmetric key cryptography. The logic is designed around a pro...
Anupam Datta, Ante Derek, John C. Mitchell, Arnab ...