Type algebras, functor categories and block structure
Algebraic methods in semantics
Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantical analysis of specification logic, 2
Information and Computation
Parametricity and local variables
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 3)
ALGOL-like languages (v.2)
Operational reasoning for functions with local state
Higher order operational techniques in semantics
Objects, interference, and the Yoneda embedding
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Objects and classes in Algol-like languages
Information and Computation - FOOL V
A Fully Abstract Game Semantics for General References
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Correctness of data representations involving heap data structures
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Using history invariants to verify observers
ESOP'07 Proceedings of the 16th European conference on Programming
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Automata-Theoretic Semantics of Idealized Algol with Passive Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
In this paper, we present a new model of class-based Algol-like programming languages inspired by automata-theoretic concepts. The model may be seen as a variant of the "object-based" model previously proposed by Reddy, where objects are described by their observable behaviour in terms of events. At the same time, it also reflects the intuitions behind state-based models studied by Reynolds, Oles, Tennent and O'Hearn where the effect of commands is described by state transformations. The idea is to view stores as automata, capturing not only their states but also the allowed state transformations. In this fashion, we are able to combine both the state-based and event-based views of objects. We illustrate the efficacy of the model by proving several test equivalences and discuss its connections to the previous models.