Deriving labels and bisimilarity for concurrent constraint programming
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
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
Efficient computation of program equivalence for confluent concurrent constraint programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.01 |
We propose a formal theory of contract-based computing. We model contracts as formulae in an intuitionistic logic extended with a "contractual'' form of implication. Decidability holds for our logic: this allows us to mechanically infer the rights and the duties deriving from any set of contracts. We embed our logic in a core calculus of contracting processes, which combines features from concurrent constraints and calculi for multiparty sessions, while subsuming several idioms for concurrency.