Communicating sequential processes
Communicating sequential processes
Semantical analysis of specification logic
Information and Computation
Parametricity and local variables
Journal of the ACM (JACM)
Handbook of logic in computer science (vol. 3)
Assignments for applicative languages
ALGOL-like Languages, Volume 1
Full abstraction for idealized Algol with passive expressions
Theoretical Computer Science - Special issue on linear logic, 1
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)
Communication and Concurrency
Algebraic Automata Theory
Automata, Languages, and Machines
Automata, Languages, and Machines
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Logic for Parametric Polymorphism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
ECCOP '98 Proceedings of the 12th European Conference on Object-Oriented Programming
A Fully Abstract Relational Model of Syntactic Control of Interference
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Permission accounting in separation logic
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A semantics for concurrent separation logic
Theoretical Computer Science
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
State-dependent representation independence
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Checking interference with fractional permissions
SAS'03 Proceedings of the 10th international conference on Static analysis
The impact of higher-order state and control effects on local relational reasoning
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Dafny: an automatic program verifier for functional correctness
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
A kripke logical relation for effect-based program transformations
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Syntactic control of interference for separation logic
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reading, writing and relations: towards extensional semantics for effect analyses
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
An automata-theoretic model of idealized algol
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Nominal Sets: Names and Symmetry in Computer Science
Nominal Sets: Names and Symmetry in Computer Science
| Hi-index | 0.00 |
Passive expressions in Algol-like languages represent computations that read the state but do not modify it. The need for such read-only computations arises in programming logics as well as in concurrent programming. It is also a central facet in Reynolds@?s Syntactic Control of Interference. Despite its importance and essentially basic character, capturing the notion of passivity in semantic models has proved to be difficult. In this paper, we provide a new model of passive expressions using an automata-theoretic framework recently proposed by the author. The central idea is that the store of a program is viewed as an abstract form of an automaton, with a representation of its states as well as state transitions. The framework allows us to combine the strengths of conventional state-based models and the more recent event-based models to synthesize new ''automata-based'' models. Once this basic framework is set up, relational parametricity does the job of identifying passive computations.