Type algebras, functor categories and block structure
Algebraic methods in semantics
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
Journal of the ACM (JACM)
Effective Axiomatizations of Hoare Logics
Journal of the ACM (JACM)
A critique of the foundations of Hoare style programming logics
Communications of the ACM
The Craft of Programming
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
The Denotational Description of Programming Languages: An Introduction
The Denotational Description of Programming Languages: An Introduction
A Theory of Programming Language Semantics
A Theory of Programming Language Semantics
An Aximatic Treatment of Algol 68 Routines
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Reasoning About Procedures as Parameters
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Hoare's Logic for Programs with Procedures - What Has Been Achieved?
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Semantical Analysis of Specification Logic
Proceedings of the Conference on Logic of Programs
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A characterization of Hoare's logic for programs with Pascal-like procedures
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A category-theoretic approach to the semantics of programming languages
A category-theoretic approach to the semantics of programming languages
Full abstraction and semantic equivalence
Full abstraction and semantic equivalence
Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Delimiting the scope of effects
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
A functional theory of local names
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametricity and local variables
Journal of the ACM (JACM)
Denotational semantics using an operationally-based term model
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Representation independence, confinement and access control [extended abstract]
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Objects and classes in Algol-like languages
Information and Computation - FOOL V
Soundness of data refinement for a higher-order imperative language
Theoretical Computer Science
Higher-Order and Symbolic Computation
A pi-calculus Process Semantics of Concurrent Idealised ALGOL
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Reasoning about Idealized ALGOL Using Regular Languages
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Reasoning about local variables with operationally-based logical relations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The regular-language semantics of second-order idealized ALGOL
Theoretical Computer Science
Compilation and equivalence of imperative objects
Journal of Functional Programming
Correctness of data representations involving heap data structures
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Ownership confinement ensures representation independence for object-oriented programs
Journal of the ACM (JACM)
Small bisimulations for reasoning about higher-order imperative programs
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 6th international conference on Aspect-oriented software development
Towards imperative modules: reasoning about invariants and sharing of mutable state
Theoretical Computer Science - Components and objects
Relational semantics for effect-based program transformations with dynamic allocation
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
A bisimulation for type abstraction and recursion
Journal of the ACM (JACM)
Typed closure conversion preserves observational equivalence
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A Theory of Non-monotone Memory (Or: Contexts for free)
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
Transactions on Aspect-Oriented Software Development V
A relational modal logic for higher-order stateful ADTs
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Logical reasoning for higher-order functions with local state
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Correctness of data representations involving heap data structures
ESOP'03 Proceedings of the 12th European conference on Programming
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
Theoretical Computer Science
An equivalence-preserving CPS translation via multi-language semantics
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Relational reasoning in a nominal semantics for storage
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Local variable scoping and kleene algebra with tests
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Relational semantics for higher-order programs
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Bisimulations for untyped imperative objects
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Behavioral interface specification languages
ACM Computing Surveys (CSUR)
An automata-theoretic model of idealized algol
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
An observationally complete program logic for imperative higher-order functions
Theoretical Computer Science
| Hi-index | 0.00 |
The Store Model of Halpern-Meyer-Trakhtenbrot is shown—after suitable repair—to be a fully abstract model for a limited fragment of ALGOL in which procedures do not take procedure parameters. A simple counter-example involving a parameter of program type shows that the model is not fully abstract in general. Previous proof systems for reasoning about procedures are typically sound for the HMT store model, so it follows that theorems about the counter-example are independent of such proof systems. Based on a generalization of standard cpo based models to structures called locally complete partial orders (lcpo's), improved models and stronger proof rules are developed to handle such examples.