Sciweavers

35 search results - page 2 / 7
» Partial Order Reduction for Branching Security Protocols
Sort
View
FM
2009
Springer
134views Formal Methods» more  FM 2009»
13 years 3 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
FSTTCS
2006
Springer
13 years 9 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...
ASE
2004
167views more  ASE 2004»
13 years 5 months ago
Cluster-Based Partial-Order Reduction
The verification of concurrent systems through an exhaustive traversal of the state space suffers from the infamous state-space-explosion problem, caused by the many interleavings ...
Twan Basten, Dragan Bosnacki, Marc Geilen
ECIS
2000
13 years 6 months ago
Security and Productivity Improvements - Sufficient for the Success of Secure Electronic Transaction?
Online payments in business-to-consumer electronic commerce are mainly made with credit cards. Fraud and chargebacks are a significant issue for merchants and payment card brands, ...
Michael Fritscher, Oliver Kump
ESORICS
2009
Springer
14 years 5 months ago
Secure Evaluation of Private Linear Branching Programs with Medical Applications
Abstract. Diagnostic and classification algorithms play an important role in data analysis, with applications in areas such as health care, fault diagnostics, or benchmarking. Bran...
Mauro Barni, Pierluigi Failla, Vladimir Kolesnikov...