3573 search results - page 178 / 715 » Reasoning about Codata |
142
Voted
CSL
2003
Springer
15 years 8 months ago
2003
Springer
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
119
Voted
CSFW
1999
IEEE
15 years 8 months ago
1999
IEEE
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
138
Voted
ISPW
1994
IEEE
15 years 7 months ago
1994
IEEE
All software projects are experiments in the sense of the scientific method because the outcomes are not known in advance, theories and hypotheses may be tested in the project emp...
125
click to vote
CAV
1993
Springer
15 years 7 months ago
1993
Springer
Abstract. This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I O automata to extract a set of proof obligations for s...
157
Voted
CSSW
2007
15 years 5 months ago
2007
: The Relationship Finder is a tool for exploring connections between objects in a Semantic Web knowledge base. It offers a new way to get insights about elements in an ontology, i...