On Backward-Style Anonymity Verification (2008)
KAWABE, Yoshinobu, MANO, Ken, SAKURADA, Hideki, TSUKADA, Yasuyuki
Many Internet services and protocols should guarantee anonymity; for example, an electronic voting system should guarantee to prevent the disclosure of who voted for which candidate. To prove trace...
Verifying Trace Equivalence of a Shared-Memory-Style Communication System (2005)
This paper describes a formal verification for a shared memory-style communication system. We first describe two versions (i.e. abstract and concrete) of the communication system based on an I/O...
On Formal Modeling of Agent Computations (2000)
Tadashi Araragi, Paul Attie, Idit Keidar, Kiyoshi Kogure, Victor Luchangco, Nancy Lynch, ...
This paper describes a comparative study of three formal methods for modeling and validating agent systems. The study is part of a joint project by researchers in MIT’s Theory of Distributed...
We present a new proof of Chew's theorem, which states that normal forms are unique up to conversion in compatible term rewriting systems. We apply the technique of left-right separated...
Unique Normal Form Property of Higher-Order Rewriting Systems (1996)
. Within the framework of Higher-Order Rewriting Systems proposed by van Oostrom, a sufficient condition for the unique normal form property is presented. This requires neither left-linearity nor...
A new proof of Chew's theorem (1994)
We present a new proof of Chew's theorem, which states that normal forms are unique up to conversion in compatible term rewriting systems. 1 Introduction A term rewriting system (TRS) R is...
On Formal Modeling of Agent Computations
Tadashi Araragi, Paul Attie, Idit Keidar, Kiyoshi Kogure, Victor Luchangco, Nancy Lynch, ...
This paper describes a comparative study of three formal methods for modeling and validating agent systems. The study is part of a joint project by researchers in MIT's Theory of Distributed...