4485 search results - page 120 / 897 » Equivalences on Observable Processes |
131
click to vote
ENTCS
2007
15 years 3 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
114
Voted
ICSM
2005
IEEE
15 years 9 months ago
2005
IEEE
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...
116
Voted
ICNP
2007
IEEE
15 years 10 months ago
2007
IEEE
- 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...
120
Voted
CTCS
1997
Springer
15 years 7 months ago
1997
Springer
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 ...
117
Voted
CCS
2006
ACM
15 years 7 months ago
2006
ACM
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...