Sciweavers

5863 search results - page 203 / 1173
» On Model-Checking of P Systems
Sort
View
USS
2010
15 years 5 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...
P2PKM
2004
15 years 8 months ago
Ontology-based Service Discovery in P2P Networks
The ubiquitous computing vision is to make knowledge and services easily available in our everyday environments. A wide range of devices, applications and services can be intercon...
Daniel Elenius, Magnus Ingmarsson
ICALP
1998
Springer
15 years 11 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
DAC
1996
ACM
15 years 11 months ago
State Reduction Using Reversible Rules
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...
C. Norris Ip, David L. Dill
JCS
2002
94views more  JCS 2002»
15 years 6 months ago
Model-Based Analysis of Configuration Vulnerabilities
Vulnerability analysis is concerned with the problem of identifying weaknesses in computer systems that can be exploited to compromise their security. In this paper we describe a ...
C. R. Ramakrishnan, R. C. Sekar