Sciweavers

92 search results - page 12 / 19
» A Formal Approach To The Protocol Converter Problem
Sort
View
FOSSACS
2001
Springer
14 years 4 days ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
BMCBI
2007
103views more  BMCBI 2007»
13 years 7 months ago
Dynamic simulation of regulatory networks using SQUAD
Background: The ambition of most molecular biologists is the understanding of the intricate network of molecular interactions that control biological systems. As scientists uncove...
Alessandro Di Cara, Abhishek Garg, Giovanni De Mic...
IFIP
2010
Springer
13 years 2 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro
IPPS
2003
IEEE
14 years 28 days ago
Anonymous Publish/Subscribe in P2P Networks
One of the most important issues to deal with in peerto-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information...
Ajoy Kumar Datta, Maria Gradinariu, Michel Raynal,...
CAV
2004
Springer
151views Hardware» more  CAV 2004»
13 years 11 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...