A fully abstract relational model of syntactic control of interference
From MaRDI portal
Recommendations
- A model for syntactic control of interference
- scientific article; zbMATH DE number 1231472
- Syntactic control of interference revisited
- Decidability and syntactic control of interference
- Decidability in syntactic control of interference
- Syntactic control of interference for separation logic
- Categorical models of syntactic control of intereference revisited, revisited
- Syntactic control of interference and concurrent separation logic
- The relational approach to computer representation of linguistic production rules and inference of decisions
Cited in
(10)- Domain theory for concurrency
- Decomposition orders -- another generalisation of the fundamental theorem of arithmetic
- Decidability and syntactic control of interference
- Automata-theoretic semantics of idealized Algol with passive expressions
- Geometry of synthesis. II: From games to delay-insensitive circuits
- Modelling local variables: possible worlds and object spaces
- scientific article; zbMATH DE number 517042 (Why is no real title available?)
- A syntactic model of mutation and aliasing
- A graph model for imperative computation
- Decidability in syntactic control of interference
This page was built for publication: A fully abstract relational model of syntactic control of interference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411827)