Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Resource traces: a domain for processes sharing exclusive resources
Theoretical Computer Science
A truly concurrent semantics for a process algebra using resource pomsets
Theoretical Computer Science
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Resource Models and Pre-Compiler Specification for Hardware/Software Co-Design Language
SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference
Retracing the semantics of CSP
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Fundamenta Informaticae - Dependently Typed Programming
| Hi-index | 0.00 |
Conventional theories of concurrency reduce parallel processes to sequential ones. Here, we propose a true concurrency trace model which takes variables of parallel processes as a whole and runs parallel processes as simultaneous updates on variables. By equipping each resource an ownership variable, the model has a uniform treatment to both variable access conflicts and resource conflicts. A denotational semantics based on the model is studied. After that, we show how to use this model to build a correct resource scheduler, and specify pre-compilers such that the resulting systems do not incur conflicts and have less chance of deadlocks.