Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relational parametricity and local variables
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the need for a popular formal semantics
ACM SIGPLAN Notices
Syntactic control of interference revisited
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Full Abstraction for the Second Order Subset of an Algol-Like Language
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Generalised Flowcharts and Games
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A New Approach to Control Flow Analysis
CC '98 Proceedings of the 7th International Conference on Compiler Construction
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A category-theoretic approach to the semantics of programming languages
A category-theoretic approach to the semantics of programming languages
Model Checking Algol-Like Languages Using Game Semantics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
On probabilistic program equivalence and refinement
CONCUR 2005 - Concurrency Theory
Homer: A Higher-Order Observational Equivalence Model checkER
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Geometry of synthesis iv: compiling affine recursion into static hardware
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Space-Efficient computation by interaction
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Compositional model extraction for higher-order concurrent programs
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Events, causality and symmetry
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized ALGOL (IA) by expressing sets of complete plays as regular languages. Being derived directly from the fully abstract game semantics for IA, our method of reasoning inherits its desirable theoretical properties. The method is mathematically elementary and formal, which makes it uniquely suitable for automation. We show that reasoning can be carried out using only a meta-language of extended regular expressions, a language for which equivalence is formally decidable.