A calculus and logic of resources and processes

Formal Aspects of Computing

Volumn 18, Issue 4, 2006, Pages 495-517

  Pym, David ^a   Tofts, Chris ^a  

^a HEWLETT PACKARD LABORATORIES   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; INTERACTIVE COMPUTER SYSTEMS; SYNCHRONIZATION;

BISIMULATION; CALCULUS MODELS; INTERACTING SYSTEMS; SYNCHRONOUS CALCULUS;

PROCESS CONTROL;

EID: 33750914676     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-006-0018-z     Document Type: Article

References (43)

1. [BGL97] Brémond-Grégoire P, Lee I (1997) A process algebra of communicating shared resources with dense time and priorities. Theor Comput Sci 189(1-2):179-219
2. [BH72] Brinch Hansen P (1972) Structured multiprogramming. Comm. ACM 15(7):574-578
3. [BH73] Brinch Hansen P (1973) Operating system principles. Prentice Hall, Englewood Cliffs
4. [BH02] Brinch Hansen P (ed) (2002) The origin of concurrent programming. Springer, Berlin Heidelberg New York
5. [Bir79] Birtwistle G (1979) Demos - discrete event modelling on Simula. Macmillan
6. [Bir81] Birtwistle G (1981) Demos implementation guide and reference manual. Technical Report 81/70/22, University of Calgary
7. [BK84] Bergstra JA, Klop JW (1984) The algebra of recursively denned processes and the algebra of regular processes. In: Proceedings of 11th ICALP, LNCS 172
8. [BT93] Birtwistle G, Tofts C (1993) An operational semantics of process-orientated simulation languages: part I π Demos. Trans Soc Comput Simul 10(4):299-333
9. [BT94] Birtwistle G, Tofts C (1994) An operational semantics of process-orientated simulation languages: part II μDemos. Trans Soc Comput Simul 11(4):303-336
10. [BT98] Birtwistle G, Tofts C (1998) A denotational semantics for a process-based simulation language. ACM ToMaCS 8(3):281-305
11. [BT00a] Birtwistle G, Tofts C (2000) Getting demos models right - part I practice. Simul Practice Theor 3:281-305
12. [BT00b] Birtwistle G, Tofts C (2000) Getting demos models right - part II ... and theory. Simul Practice Theor 3:281-305
13. [CC03] Cardelli L, Caires L (2003) A spatial logic of concurrency (part i). Inf Comput 186(2):194-235
14. [Cle65] Clementson AT (1965) Extended control and simulation language. Comput J 9(3)
15. [Dam90] Dam MF (1990) Relevance logic and concurrent computation. Ph.D. thesis, University of Edinburgh
16. [Dij68] Dijkstra EW (1968) Cooperating sequential processes. In: Progamming L, Academic Press, Reprinted in [BH02], pp 43-112 New York
17. [Dij71] Dijkstra EW (1971) Hierarchical ordering of sequential processes. Acta Informatica 1(2):115-138, Reprinted in [BH02].
18. [Dun86] Dunn JM (1986) Relevant logic and entailment. In: Gabbay D, Guenthner F (eds) Handbook of philosophical logic, vol III: alternatives to classical logic, number 166 in Synthese Library, D. Reidel, Dordrecht, Holland, pp 117-224
19. [Gir87] Girard J-Y (1987) Linear logic. Theoret Comput Sci, pp. 1-102
20. [GM04] Gastin P, Mislove M (2004) A simple process algebra based on atomic actions with resources. Math Struct Comput Sci 14:1-55
21. [GMP02] Galmiche D, Méry D, Pym D (2002) Resource Tableaux. In: Proceedings of CSL 2002. vol 2471 of LNCS, pp 183-199
22. [Gun92] Gunter CA (1992) Semantics of programming languages: structures and techniques. The MIT Press, Cambridge
23. [Hoa72] Hoare CAR (1972) Towards a theory of parallel programming. In: Hoare, Perrot (eds) Operating systems techniques. Academic Press, New York Reprinted in [BH02]
24. [Hoa74] Hoare CAR (1974) Monitors: an operating system structuring concept. Commun ACM 17(10):549-557
25. [Hoa85] Hoare C (1985) Communicating sequential processes. Prentice-Hall, Englewood Cliffs
26. [IO01] Ishtiaq SS, O'Heam P (2001) BI as an assertion language for mutable data structures. In: 28th ACM-SIGPLAN symposium on principles of programming languages, London, pp 14-26, Association for Computing Machinery
27. [Kri63] Kripke SA (1963) Semantical considerations on modal logic. Acta Philosophica Fennica 16:83-94
28. [Kri65] Kripke SA (1965) Semantical analysis of intuitionistic logic I. In: Crossley JN, Dummett MAE (eds) Formal systems and recursive functions, North-Holland, Amsterdam, pp 92-130
29. [Maz87] Mazurkiewicz A (1987) Trace theory. Lecture Notes Comput Sci 255:279-324
30. [Mil83] Milner R (1983) Calculi for synchrony and asynchrony. Theoret Comput Sci 25(3):267-310
31. [Mil89] Milner R (1989) Communication and concurrency. Prentice-Hall, Englewood Cliffs
32. [Mil99] Milner R (1999) Communication systems and the π-calculus. Cambridge University Press, Cambridge
33. [OG76] Owicki S, Gries D (1976) Verifying properties of parallel programs: an axiomatic approach. Commun ACM 19(5):279-285
34. [O'H04] O'Hearn P (2004) Resources, concurrency, and local reasoning. In: Proceedings of Concur 04, London, LNCS. Springer, Berlin Heidelberg New York
35. [OP99] O'Hearn PW, Pym DJ (1999) The logic of bunched implications. Bull Symbol Logic 5(2):215-244
36. [POY04] Pym DJ, O'Hearn PW, Yang H (2004) Possible worlds and resources: the semantics of BI. Theoret Comput Sci 315(1):257-305. Erratum: p. 285,1.-12:", for some P′, Q ≡ P; P′" should be "P ⊢ Q"
37. [Pym02] Pym DJ (2002) The semantics and proof theory of the logic of the logic of bunched implications, vol 26 of Applied Logic Series. Kluwer Dordrecht. Errata and Remarks [Pym04] maintained at: http://www.cs.bath.ac.uk/pym/BI- monograph-errata.pdf
38. [Pym04] Pym DJ (2004) Errata and remarks for The semantics and proof theory of the logic of bunched implications [Pym02], Maintained at:http://www.cs.bath.ac.uk/pym/BI-monograph-errata.pdf
39. [Rey02] Reynolds JC (2002) Separation logic: a logic for shared mutable data structures. In: Proceedings of LICS'02, IEEE Computer Society Press, pp 55-74
40. [RM72] Routley R, Meyer RK (1972) The semantics of entailment, II-III. J Phils Logic 1:53-73 and 192-208
41. [Sti01] Stirling C (2001) Modal and temporal properties of processes. Springer, Berlin Heidelberg New York
42. [Tof94] Tofts C (1994) Processes with probability, priority and time. Formal Aspects Comput Sci 6(5):536-564
43. [Tof03] Tofts C (2003) Efficiently modelling resource in a process algebra. Technical Report HPL-2003-181, HP Laboratories, Bristol