An approach to deciding the observational equivalence of Algol-like languages
type: Item
instance of: scholarly article
title: An approach to deciding the observational equivalence of Algol-like languages
zbMATH Open document ID: 1072.68031
author: Yanyan Li
published in: Annals of Pure and Applied Logic
publication date: 2004-11-18T00:00:00Z
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2116238
zbMATH Keywords: Algorithmic game semantics
zbMATH Keywords: Algol-like languages
zbMATH Keywords: Automata theory
zbMATH Keywords: Software model-checking
MaRDI profile type: Publication
full work available at URL: j.apal.2003.12.006
OpenAlex ID: W2135774937
cites work: Q4823132
cites work: Full abstraction for PCF
cites work: Q4222822
cites work: Regular-Language Semantics for a Call-by-Value Programming Language
cites work: Q2754137
cites work: Deterministic context free languages
cites work: Symbolic bisimulations
cites work: Q4225150
cites work: On full abstraction for PCF: I, II and III
cites work: The Complexity of Finite Memory Programs with Recursion
cites work: Q4344149
cites work: Finitary PCF is not decidable
cites work: Q4870803
cites work: Q5590814
cites work: Linear Automaton Transformations
cites work: Parametricity and local variables
cites work: Q4415241
cites work: The equivalence problem for real-time strict deterministic languages
cites work: Q4813228
cites work: Operational reasoning for functions with local state
cites work: LCF considered as a programming language
cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY
cites work: \(L(A)=L(B)\)? decidability results from complete formal systems
cites work: Decidability of DPDA equivalence
cites work: Q4737211
DOI: 10.1016/J.APAL.2003.12.006
description: scientific article; zbMATH DE number 2116238