# Observational equivalence

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- ACM Conference on Computer and Communicationsâ€¦
- 2015

Many cryptographic security definitions can be naturally formulated as observational equivalence properties. However, existingâ€¦Â (More)

Is this relevant?

2009

2009

- 22nd IEEE Computer Security Foundations Symposium
- 2009

Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on traceâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- ACM Conference on Computer and Communicationsâ€¦
- 2008

Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, weâ€¦Â (More)

Is this relevant?

2008

2008

- ICFP
- 2008

Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in questionâ€¦Â (More)

Is this relevant?

2007

2007

- Electr. Notes Theor. Comput. Sci.
- 2007

We define an observational equivalence for Lafontâ€™s interaction combinators, which we prove to be the least discriminating nonâ€¦Â (More)

Is this relevant?

2002

2002

- LICS
- 2002

We prove that observational equivalence of 3rd-order finitary Idealized Algol (IA) is decidable using Game Semantics. Byâ€¦Â (More)

Is this relevant?

2001

2001

- TACS
- 2001

We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamicallyâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Mathematical Structures in Computer Science
- 1997

Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphicâ€¦Â (More)

Is this relevant?

1996

1996

- Theor. Comput. Sci.
- 1996

We show that observational equivalence can be characterized by saturating homomorphisms (with respect to Hennessy-Milner logicâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Inf. Comput.
- 1989

Finite state automata, with non-determinism and silent transitions, can be interpreted not as subsets of the free monoid as inâ€¦Â (More)

Is this relevant?