Sciweavers

240 search results - page 38 / 48
» Infinite trace equivalence
Sort
View
CONCUR
2006
Springer
14 years 10 days ago
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
Yoshinao Isobe, Markus Roggenbach
CSFW
2008
IEEE
13 years 10 months ago
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus
We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this...
Michael Backes, Catalin Hritcu, Matteo Maffei
ACL
2006
13 years 10 months ago
A DOM Tree Alignment Model for Mining Parallel Data from the Web
This paper presents a new web mining scheme for parallel data acquisition. Based on the Document Object Model (DOM), a web page is represented as a DOM tree. Then a DOM tree align...
Lei Shi, Cheng Niu, Ming Zhou, Jianfeng Gao
ENTCS
2006
151views more  ENTCS 2006»
13 years 8 months ago
Stochastic Simulation Methods Applied to a Secure Electronic Voting Model
We demonstrate a novel simulation technique for analysing large stochastic process algebra models, applying this to a secure electronic voting system example. By approximating the...
Jeremy T. Bradley, Stephen T. Gilmore
ENTCS
2007
105views more  ENTCS 2007»
13 years 8 months ago
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols
When modelling cryto-protocols by means of process calculi which express both nondeterministic and probabilistic behavior, it is customary to view the scheduler as an intruder. It...
Srecko Brlek, Sardaouna Hamadou, John Mullins