Sciweavers

238 search results - page 22 / 48
» Compositional Proof Methods for Concurrency: A Semantic Appr...
Sort
View
CSFW
2010
IEEE
15 years 29 days ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin
88
Voted
CAV
2007
Springer
164views Hardware» more  CAV 2007»
15 years 1 months ago
SAT-Based Compositional Verification Using Lazy Learning
Abstract. A recent approach to automated assume-guarantee reasoning (AGR) for concurrent systems relies on computing environment assumptions for components using the L algorithm fo...
Nishant Sinha, Edmund M. Clarke
VSTTE
2005
Springer
15 years 3 months ago
Verifying Design with Proof Scores
: Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for ver...
Kokichi Futatsugi, Joseph A. Goguen, Kazuhiro Ogat...
JSW
2008
167views more  JSW 2008»
14 years 9 months ago
An Approach to Discover Dependencies between Service Operations
Service composition is emerging as an important paradigm for constructing distributed applications by combining and reusing independently developed component services. One key issu...
Shuying Yan, Jing Wang 0002, Chen Liu, Lei Liu
IJIS
2002
86views more  IJIS 2002»
14 years 9 months ago
Dynamics and control in component-based agent models
Dynamics are an important aspect of agent models. Control of dynamics requires specific methods of specification that have their own specific semantics. This paper addresses speci...
Frances M. T. Brazier, Catholijn M. Jonker, Jan Tr...