Results 1  10
of
546,607
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
; the spi calculus enables us to consider cryptographic issues in more detail. We represent protocols as processes in the spi calculus and state their security properties in terms of coarsegrained notions of protocol equivalence.
A BRUTUS Logic for the SpiCalculus
 In: Proceedings of the IFIP Workshop on Issues in the Theory of Security. (2001
, 2001
"... A spicalculus dialect and its BRUTUS logic is presented. The BRUTUS logic is a temporal first order logic defined within the BRUTUS model checker by Clarke, Jha and Marrero [10], and its use within spicalculus like languages can help in expressing security properties. The spicalculus dialect i ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A spicalculus dialect and its BRUTUS logic is presented. The BRUTUS logic is a temporal first order logic defined within the BRUTUS model checker by Clarke, Jha and Marrero [10], and its use within spicalculus like languages can help in expressing security properties. The spicalculus dialect
On Compositional Reasoning in the Spicalculus
 In Proc. of the 5th International Conference on Foundations of Software Science and Computation Structures (FossaCS’02), volume 2303 of LNCS
, 2002
"... Observational equivalences can be used to reason about the correctness of security protocols described in the spicalculus. Unlike in CCS or in #calculus, these equivalences do not enjoy a simple formulation in spicalculus. The present paper aims at enriching the set of tools for reasoning on proc ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Observational equivalences can be used to reason about the correctness of security protocols described in the spicalculus. Unlike in CCS or in #calculus, these equivalences do not enjoy a simple formulation in spicalculus. The present paper aims at enriching the set of tools for reasoning
PatternMatching SpiCalculus
 In Formal Aspects in Security and Trust
, 2004
"... Abstract. Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on types for authenticity did not allow for such nested cryptography. In this work, we present the patternmatching s ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
matching spicalculus, which is an obvious extension of the spicalculus to include patternmatching as primitive. The novelty of the language is in the accompanying type system, which uses the same language of patterns to describe complex data dependencies which cannot be described using prior type systems
PVS: A Prototype Verification System
 CADE
, 1992
"... PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available. ..."
Abstract

Cited by 654 (16 self)
 Add to MetaCart
PVS is a prototype system for writing specifications and constructing proofs. Its development has been shaped by our experiences studying or using several other systems and performing a number of rather substantial formal verifications (e.g., [5,6,8]). PVS is fully implemented and freely available
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finitestate concurrent systems. Experimental results show that state machines
The SpiCalculus and a Bisimulation Method
, 1999
"... We present the spicalculus, an extension of the calculus, developped by Abadi and Gordon [AG98b]. Strengths and weaknesses of the model are analyzed. A Bisimulation method (framed bisimulation), used to equate two cryptographically equivalent processes written in spicalculus, dened in [AG98a] i ..."
Abstract
 Add to MetaCart
We present the spicalculus, an extension of the calculus, developped by Abadi and Gordon [AG98b]. Strengths and weaknesses of the model are analyzed. A Bisimulation method (framed bisimulation), used to equate two cryptographically equivalent processes written in spicalculus, dened in [AG98a
Security API analysis with the spicalculus
"... Abstract: API level vulnerabilities of hardware security modules represent a serious threat, thus, discovering and patching security holes in APIs are important. In this paper, we argue and illustrate that the application of formal verification methods is a promising approach for API analysis. In pa ..."
Abstract
 Add to MetaCart
Abstract: API level vulnerabilities of hardware security modules represent a serious threat, thus, discovering and patching security holes in APIs are important. In this paper, we argue and illustrate that the application of formal verification methods is a promising approach for API analysis
A Survey of Program Slicing Techniques
 JOURNAL OF PROGRAMMING LANGUAGES
, 1995
"... A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest, referred to as a slicing criterion. The task of computing program slices is called program slicing. The original definition of a program slice was presented by Weiser in 197 ..."
Abstract

Cited by 777 (8 self)
 Add to MetaCart
, whereas the latter relies on some specific test case. Procedures, arbitrary control flow, composite datatypes and pointers, and interprocess communication each require a specific solution. We classify static and dynamic slicing methods for each of these features, and compare their accuracy
DART: Directed automated random testing
 In Programming Language Design and Implementation (PLDI
, 2005
"... We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static sourcecode parsing; (2) automatic generation of a test driver for this interface that performs ..."
Abstract

Cited by 823 (41 self)
 Add to MetaCart
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static sourcecode parsing; (2) automatic generation of a test driver for this interface
Results 1  10
of
546,607