Sciweavers

1796 search results - page 191 / 360
» An Approach to Compositional Model Checking
Sort
View
CSFW
2008
IEEE
14 years 2 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
AAAI
2008
13 years 10 months ago
Generating Application-Specific Benchmark Models for Complex Systems
Automated generators for synthetic models and data can play a crucial role in designing new algorithms/modelframeworks, given the sparsity of benchmark models for empirical analys...
Jun Wang, Gregory M. Provan
SOCA
2007
IEEE
14 years 2 months ago
Static Analysis of Business Artifact-centric Operational Models
Business Artifacts are the core entities used by businesses to record information pertinent to their operations. Business operational models are representations of the processing ...
Cagdas E. Gerede, Kamal Bhattacharya, Jianwen Su
ENTCS
2007
99views more  ENTCS 2007»
13 years 8 months ago
Extending Symmetry Reduction Techniques to a Realistic Model of Computation
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be repres...
Alastair F. Donaldson, Alice Miller
ICPP
1993
IEEE
14 years 14 days ago
A Unified Model for Concurrent Debugging
: Events are occurrence instances of actions. The thesis of this paper is that the use of “actions”, instead of events, greatly simplifies the problem of concurrent debugging....
S. I. Hyder, John Werth, James C. Browne