Sciweavers

4485 search results - page 120 / 897
» Equivalences on Observable Processes
Sort
View
ENTCS
2007
137views more  ENTCS 2007»
13 years 10 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
ICSM
2005
IEEE
14 years 3 months ago
Refactoring a Java Code Base to AspectJ: An Illustrative Example
This paper describes a refactoring process transforming a Java code base into an AspectJ equivalent. The process illustrates 17 aspect-oriented refactorings covering extraction of...
Miguel P. Monteiro, João M. Fernandes
ICNP
2007
IEEE
14 years 4 months ago
Network Court Protocol and Malicious Node Conviction
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
Na Li, David Lee
CTCS
1997
Springer
14 years 2 months ago
Monads and Modular Term Rewriting
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
Christoph Lüth, Neil Ghani
CCS
2006
ACM
14 years 1 months ago
An intruder model for verifying liveness in security protocols
We present a process algebraic intruder model for verifying a class of liveness properties of security protocols. For this class, the proposed intruder model is proved to be equiv...
Jan Cederquist, Muhammad Torabi Dashti