Reasoning about Idealized Algol using regular languages

DOI10.1007/3-540-45022-X_10MaRDI QIDQ2754137zbMATH OpenFDO

Authors Dan R. Ghica, Guy McCusker

Publication date 6 December 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45022-X_10

Mathematics Subject Classification ID

Theory of programming languages (68N15) Formal languages and automata (68Q45)

Recommendations

• The regular-language semantics of second-order idealized ALGOL
• An automata-theoretic model of Idealized Algol (extended abstract)
• Automata-theoretic semantics of idealized Algol with passive expressions
• Logic Meets Algebra: the Case of Regular Languages
• scientific article; zbMATH DE number 3917732
• scientific article; zbMATH DE number 7362722
• On algebraic and logical specifications of classes of regular languages.
• A constructive theory of regular languages in Coq
• An approach to deciding the observational equivalence of Algol-like languages
• Regular ideal languages and their Boolean combinations

Cited in

(21)

• Full abstraction for PCF
• The regular-language semantics of second-order idealized ALGOL
• An approach to deciding the observational equivalence of Algol-like languages
• Leafy automata for higher-order concurrency
• Third-order Idealized Algol with iteration is decidable
• Angelic semantics of fine-grained concurrency
• Games for complexity of second-order call-by-name programs
• Game semantics for access control
• Contextual approximation and higher-order procedures
• A categorical semantics of higher order store
• An automata-theoretic model of Idealized Algol (extended abstract)
• scientific article; zbMATH DE number 3890697 (Why is no real title available?)
• Program equivalence in a simple language with state
• Regular-language semantics for a call-by-value programming language
• Logic and geometry of agents in agent-based modeling
• A case study in programming coinductive proofs: Howe's method
• About the undecidability of program equivalence in finitary languages with state
• Functions with local state: regularity and undecidability
• Foundations of Software Science and Computational Structures
• Symbolic execution game semantics
• Syntactic control of concurrency

This page was built for publication: Reasoning about Idealized Algol using regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754137)