A calculus of contracting processes

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2010, Pages 332-341

  Bartoletti, Massimo ^a   Zunino, Roberto ^b  

^a UNIVERSITY OF CAGLIARI   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

Circular assume guarantee; Concurrent constraints; Contracts; Cut elimination

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; CONTRACTS; MODEL CHECKING;

CIRCULAR ASSUME-GUARANTEE; CONCURRENT CONSTRAINT; CONTRACTING PROCESS; CORE CALCULUS; CUT ELIMINATION; FORMAL THEORY; INTUITIONISTIC LOGIC; MULTIPARTY SESSIONS;

COMPUTER CIRCUITS;

EID: 78449272959     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2010.25     Document Type: Conference Paper

References (39)

1. V. Saraswat, P. Panangaden, and M. Rinard, "Semantic foundations of concurrent constraint programming," in Proc. POPL, 1991.
2. M. Wirsing et al., "SENSORIA process calculi for service-oriented computing," in Proc. TGC, 2006.
3. M. Coppo and M. Dezani-Ciancaglini, "Structured communications with concurrent constraints," in Proc. TGC, 2008.
4. J. Parrow and B. Victor, "The fusion calculus: Expressiveness and symmetry in mobile processes," in Proc. LICS, 1998.
5. The PCL web site, http://www.disi.unitn.it/~zunino/PCL.
6. M. Bartoletti and R. Zunino, "A logic for contracts," Univ. Trento, Tech. Rep. DISI-09-034, 2009.
7. -, "A calculus of contracting processes," Univ. Trento, Tech. Rep. DISI-09-056, 2009.
8. F. Pfenning, "Structural cut elimination - intuitionistic and classical logic," Information and Computation, vol. 157, 2000.
9. M. Fairtlough and M. Mendler, "Propositional lax logic," Information and Computation, vol. 137, no. 1, pp. 1-33, 1997.
10. R. Statman, "Intuitionistic propositional logic is polynomial-space complete," Theoretical Computer Science, vol. 9, 1979.
11. D. Garg and M. Abadi, "A modal deconstruction of access control logics," in Proc. FoSSaCS, 2008.
12. D. Gelernter, "Generative communication in Linda," ACM TOPLAS, vol. 7, no. 1, 1985.
13. H. Davulcu, M. Kifer, and I. Ramakrishnan, "CTR-S: A logic for specifying contracts in semantic web services," in Proc. WWW, 2004.
14. A. Daskalopulu and T. Maibaum, "Towards electronic contract performance," in Proc. DEXA, 2001.
15. C. Prisacariu and G. Schneider, "A formal language for electronic contracts," in Proc. FMOODS, 2007.
16. J. Gelati, A. Rotolo, G. Sartor, and G. Governatori, "Normative autonomy and normative co-ordination: Declarative power, representation, and mandate," Artificial Intelligence and Law, vol. 12, no. 1-2, pp. 53-81, 2004.
17. G. K. Giannikis and A. Daskalopulu, "The representation of e-contracts as default theories," in New Trends in Applied Artificial Intelligence, 2007.
18. G. Governatori, "Representing business contracts in RuleML," Int. J. of Cooperative Information Systems, vol. 14, no. 2-3, 2005.
19. M. Abadi and G. D. Plotkin, "A logical view of composition," Theoretical Computer Science, vol. 114, no. 1, pp. 3-30, 1993.
20. M. Abadi and L. Lamport, "Composing specifications," ACM TOPLAS, vol. 15, no. 1, pp. 73-132, 1993.
21. P. Maier, "Compositional circular assume-guarantee rules cannot be sound and complete," in Proc. FoSSaCS, 2003.
22. M. Abadi, M. Burrows, B. Lampson, and G. Plotkin, "A calculus for access control in distributed systems," ACM TOPLAS, vol. 4, no. 15, pp. 706-734, 1993.
23. N. Li, B. N. Grosof, and J. Feigenbaum, "Delegation logic: A logic-based approach to distributed authorization," ACM TISSEC, vol. 6, no. 1, pp. 128-171, 2003.
24. J. Y. Halpern and Y. Moses, "Knowledge and common knowledge in a distributed environment," J. ACM, vol. 37, no. 3, 1990.
25. S. Kremer, O. Markowitch, and J. Zhou, "An intensive survey of fair non-repudiation protocols," Computer Communications, vol. 25, 2002.
26. J. Zhou, Non-repudiation in Electronic Commerce. Artech House, 2001.
27. N. Asokan, V. Shoup, and M. Waidner, "Optimistic fair exchange of digital signatures," in EUROCRYPT, 1998.
28. V. Cortier, R. Küsters, and B. Warinschi, "A cryptographic model for branching time security properties - the case of contract signing protocols," in Proc. ESORICS, 2007.
29. D. Kähler and R. Küsters, "Constraint solving for contract-signing protocols," in Proc. CONCUR, 2005.
30. G. Castagna, N. Gesbert, and L. Padovani, "A theory of contracts for web services," ACM TOPLAS, vol. 31, no. 5, 2009.
31. G. Castagna and L. Padovani, "Contracts for mobile processes," in Proc. CONCUR, 2009.
32. M. G. Buscemi and U. Montanari, "CC-Pi: A constraint-based language for specifying service level agreements," in Proc. ESOP, 2007.
33. L. Bocchi, C. Laneve, and G. Zavattaro, "A calculus for long running transactions," in Proc. FMOODS, 2003.
34. R. Bruni, H. C. Melgratti, and U. Montanari, "Theoretical foundations for compensations in flow composition languages," in Proc. POPL, 2005.
35. M. J. Butler, C. A. R. Hoare, and C. Ferreira, "A trace semantics for long-running transactions," in Communicating Sequential Processes: The First 25 Years, 2004.
36. H. Garcia-Molina and K. Salem, "Sagas," in Proc. SIGMOD, 1987.
37. M. G. Buscemi and H. C. Melgratti, "Transactional service level agreement," in Proc. TGC, 2007.
38. K. Krukow, M. Nielsen, and V. Sassone, "A logical framework for history-based access control and reputation systems," J. of Computer Security, vol. 16, no. 1, pp. 63-101, 2008.
39. H. DeYoung, D. Garg, and F. Pfenning, "An authorization logic with explicit time," in Proc. CSF, 2008.