18 search results - page 2 / 4 » Polarized Process Algebra and Program Equivalence |
PDSE
1998
13 years 6 months ago
1998
This paper proposes a theoretical framework for verifying and deriving code optimizations for programs written in parallel programming languages. The key idea of this framework is...
ICFP
1996
ACM
13 years 9 months ago
1996
ACM
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
Peer-to-peer systems, exchanging dynamic documents through Web services, are a simple and effective platform for data integration on the internet. Dynamic documents can contain b...
APLAS
2009
ACM
13 years 12 months ago
2009
ACM
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
CTCS
1997
Springer
13 years 9 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 ...