Sciweavers

289 search results - page 41 / 58
» Formal Verification of Security Model Using SPR Tool
Sort
View
CSFW
2007
IEEE
14 years 2 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
OOPSLA
2010
Springer
13 years 5 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
ICSE
2004
IEEE-ACM
14 years 1 months ago
Precise Modeling of Design Patterns in UML
Prior research attempts to formalize the structure of object-oriented design patterns for a more precise specification of design patterns. It also allows automation support to be ...
Jeffrey Ka-Hing Mak, Clifford Sze-Tsan Choy, Danie...
EDOC
2002
IEEE
14 years 20 days ago
Model-Based Risk Assessment to Improve Enterprise Security
The main objective of the CORAS project is to provide methods and tools for precise, unambiguous, and efficient risk assessment of security critical systems. To this end, we advoc...
Jan Øyvind Aagedal, Folker den Braber, Theo...