Searching for authors named "Darrell Kindred" – sorted by Relevance.
-
Fast, Automatic Checking of Security Protocols
- Protocols in electronic commerce and other securitysensitive applications require careful reasoning to demonstrate their robustness against attacks. Several logics have been developed for doing this reasoning formally,but protocol designers usually do the proofs by hand, a process which is time-cons
- Cited by 6 (0 self) – Add To MetaCart
-
Theory Generation for Security Protocols
- We introduce theory generation, a new general-purpose technique for performing automated verification. Theory generation draws inspiration from, and complements, both automated theorem proving and symbolic model checking, the two approaches that currently dominate mechanical reasoning. At the core o
- Cited by 10 (0 self) – Add To MetaCart
-
Fast, Automatic Checking of Security Protocols
- Protocols in electronic commerce and other securitysensitive applications require careful reasoning to demonstrate their robustness against attacks. Several logics have been developed for doing this reasoning formally,but protocol designers usually do the proofs by hand, a process which is time-cons
- Add To MetaCart
-
Closing the Idealization Gap
- Darrell Kindred Jeannette M. Wing Computer Science Department Carnegie Mellon University fdkindred,wingg@cs.cmu.edu August 1997 1 Overview Cryptographic protocol design demands careful verification during all phases of development. Belief logics, in the tradition of the Burrows, Abadi, and Nee
- Add To MetaCart
-
Composing First-Class Transactions
- this paper. The Venari/ML technical report gives further details of these interfaces and examples showing their use [Wing, Faehndrich, Haines, Kietzke, Kindred, Morrisett, and Nettles 1993].
- Cited by 31 (1 self) – Add To MetaCart
-
Tinkertoy Transactions
- We describe the design of a transaction facility for a language that supports higher-order functions. We factor transactions into four separable features: persistence, undoability, locking, and threads. Then, relying on function composition, we show how we can put them together again. Our "Tinkertoy
- Cited by 1 (0 self) – Add To MetaCart
-
Nicholas Haines Darrell Kindred J. Gregory Morrisett Scott M. Nettles Jeannette M. Wing December 1993
- We describe the design of a transaction facility for a language that supports higher-order functions. We factor transactions into four separable features: persistence, undoability, locking, and threads. Then, relying on function composition, we show how we can put them together again. Our "Tinkertoy
- Add To MetaCart

