Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,394,739 papers from all fields of science
Search
Sign In
Create Free Account
Observational equivalence
Known as:
Contextual equivalence
, Observationally equivalent
, Operational equivalence
Observational equivalence is the property of two or more underlying entities being indistinguishable on the basis of their observable implications…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Chaos theory
Denotational semantics
ProVerif
Quantum reference frame
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Optimal context-sensitive dynamic partial order reduction with observers
E. Albert
,
M. G. D. L. Banda
,
M. Gómez-Zamalloa
,
Miguel Isabel
,
Peter James Stuckey
International Symposium on Software Testing and…
2019
Corpus ID: 195891514
Dynamic Partial Order Reduction (DPOR) algorithms are used in stateless model checking to avoid the exploration of equivalent…
Expand
2017
2017
Multipartite Composition of Contextuality Scenarios
A. B. Sainz
,
Elie Wolfe
2017
Corpus ID: 118904804
Contextuality is a particular quantum phenomenon that has no analogue in classical probability theory. Given two independent…
Expand
2012
2012
On Capital Inflows , Liquidity and Bubbles
2012
Corpus ID: 13521588
The paper is motivated by the fact that past financial crises have raised serious concerns about a new wave of capital inflows…
Expand
2009
2009
Relational parametricity for references and recursive types
L. Birkedal
,
Kristian Støvring
,
Jacob Thamsborg
ACM SIGPLAN International Workshop on Types In…
2009
Corpus ID: 2126515
We present a possible world semantics for a call-by-value higher-order programming language with impredicative polymorphism…
Expand
2009
2009
CCA: A Calculus of Context-Aware Ambients
F. Siewe
,
A. Cau
,
H. Zedan
International Conference on Advanced Information…
2009
Corpus ID: 7869433
We present a process calculus, CCA, for the modelling and verification of mobile systems that are context-aware. This process…
Expand
2007
2007
Higher-Order Logic Programming Languages with Constraints: A Semantics
James Lipton
,
S. Nieva
International Conference on Typed Lambda Calculus…
2007
Corpus ID: 5618115
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church's Theory of Types…
Expand
2003
2003
The Equivalence Problem for t-Turn DPDA Is Co-NP
Géraud Sénizergues
International Colloquium on Automata, Languages…
2003
Corpus ID: 10940110
We introduce new tools allowing to deal with the equality-problem for prefix-free languages. We illustrate our ideas by showing…
Expand
2001
2001
Observational Equivalence for Synchronized Graph Rewriting with Mobility
B. König
,
U. Montanari
Theoretical Aspects of Computer Software
2001
Corpus ID: 7536747
We introduce a notion of bisimulation for graph rewriting systems, allowing us to prove observational equivalence for dynamically…
Expand
1999
1999
Semantical Analysis of Perpetual Strategies in lambda-Calculus
F. Honsell
,
Marina Lenisa
Theoretical Computer Science
1999
Corpus ID: 18902108
1998
1998
Monadic Type Systems: Pure Type Systems for Impure Settings
G. Barthe
,
J. Hatcliff
,
Peter Thiemann
HOOTS
1998
Corpus ID: 31305620
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE