441 search results - page 2 / 89 » A Method for Proving Observational Equivalence |
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
LICS
1992
IEEE
13 years 11 months ago
1992
IEEE
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
MCSS
2002
Springer
13 years 7 months ago
2002
Springer
In this paper, we study the observability properties of nonlinear discrete time systems. Two types of contributions are given. First, we present observability criteria in terms of...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...