Handbook of theoretical computer science (vol. B)
On the decidability of process equivalences for the &pgr;-calculus
Theoretical Computer Science - Special issue on algebraic methodology and software technology
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
ACM Computing Surveys (CSUR)
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specifying norm-governed computational societies
ACM Transactions on Computational Logic (TOCL)
A theory of contracts for Web services
ACM Transactions on Programming Languages and Systems (TOPLAS)
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
A formal language for electronic contracts
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Towards a unifying theory for choreography conformance and contract compliance
SC'07 Proceedings of the 6th international conference on Software composition
A theory of design-by-contract for distributed multiparty interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A Calculus of Contracting Processes
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
A basic contract language for web services
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Constraints for service contracts
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
On the realizability of contracts in dishonest systems
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
On the realizability of contracts in dishonest systems
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
A theory of agreements and protection
POST'13 Proceedings of the Second international conference on Principles of Security and Trust
| Hi-index | 0.00 |
We develop a theory of contracting systems, where behavioural contracts may be violated by dishonest participants after they have been agreed upon -- unlike in traditional approaches based on behavioural types. We consider the contracts of [10], and we embed them in a calculus that allows distributed participants to advertise contracts, reach agreements, query the fulfilment of contracts, and realise them (or choose not to). Our contract theory makes explicit who is culpable at each step of a computation. A participant is honest in a given context S when she is not culpable in each possible interaction with S. Our main result is a sufficient criterion for classifying a participant as honest in all possible contexts.