240 search results - page 25 / 48 » Infinite trace equivalence |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We consider the relational characterisation of branching bisimilarity with explicit divergence. We prove that it is an equivalence and that it coincides with the original...
CCS
2008
ACM
13 years 10 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
ENTCS
2006
13 years 8 months ago
2006
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
FMCO
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Object calculi have been investigated as semantical foundation for object-oriented languages. Often, they are object-based, whereas the mainstream of object-oriented lang...
ENTCS
2007
13 years 8 months ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....