An approach to deciding the observational equivalence of Algol-like languages

DOI10.1016/J.APAL.2003.12.006zbMath1072.68031OpenAlexW2135774937MaRDI QIDQ1886322

Yanyan Li

Publication date: 18 November 2004

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2003.12.006

zbMATH Keywords

Algol-like languagesAutomata theoryAlgorithmic game semanticsSoftware model-checking

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Unnamed Item ⋮ Decidability and syntactic control of interference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• LCF considered as a programming language
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• \(L(A)=L(B)\)? decidability results from complete formal systems
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Linear Automaton Transformations
• The equivalence problem for real-time strict deterministic languages
• The Complexity of Finite Memory Programs with Recursion
• Parametricity and local variables
• Regular-Language Semantics for a Call-by-Value Programming Language
• Deterministic context free languages
• Decidability of DPDA equivalence
• Finitary PCF is not decidable

This page was built for publication: An approach to deciding the observational equivalence of Algol-like languages