Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making Components Contract Aware
Computer
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
On Kleene Algebras and Closed Semirings
MFCS '90 Proceedings of the Mathematical Foundations of Computer Science 1990
Towards Electronic Contract Performance
DEXA '01 Proceedings of the 12th International Workshop on Database and Expert Systems Applications
µcke - Efficient µ-Calculus Model Checking
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
A Decision Procedure for the Propositional µ-Calculus
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A practical decision method for propositional dynamic logic (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Dynamic algebras and the nature of induction
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
CTR-S: a logic for specifying contracts in semantic web services
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
On Comprehensive Contractual Descriptions of Web Services
EEE '05 Proceedings of the 2005 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'05) on e-Technology, e-Commerce and e-Service
A Fixed-point Characterization of a Deontic Logic of Regular Action
Fundamenta Informaticae - Deontic Logic in Computer Science
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Nested rules in defeasible logic
RuleML'05 Proceedings of the First international conference on Rules and Rule Markup Languages for the Semantic Web
Components, objects, and contracts
Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
Run-Time Monitoring of Electronic Contracts
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Challenges in the Specification of Full Contracts
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
$\mathcal{CL}$: An Action-Based Logic for Reasoning about Contracts
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Automatic Conflict Detection on Contracts
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
On the Specification of Full Contracts
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
CLAN: A Tool for Contract Analysis and Conflict Discovery
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Semantic Expression and Execution of B2B Contracts on Multimedia Content
SAMT '09 Proceedings of the 4th International Conference on Semantic and Digital Media Technologies: Semantic Multimedia
Model checking contracts: a case study
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Liability in software engineering: overview of the LISE approach and illustration on a case study
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
A controlled language for the specification of contracts
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Liability issues in software engineering: the use of formal methods to reduce legal uncertainties
Communications of the ACM
Formal methods as a link between software code and legal rules
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Towards verifying contract regulated service composition
Autonomous Agents and Multi-Agent Systems
Contractually compliant service compositions
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
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.03 |
In this paper we propose a formal language for writing electronic contracts, based on the deontic notions of obligation, permission, and prohibition. We take an ought-to-do approach, where deontic operators are applied to actions instead of state-of-affairs. We propose an extension of the µ-calculus in order to capture the intuitive meaning of the deontic notions and to express concurrent actions. We provide a translation of the contract language into the logic, the semantics of which faithfully captures the meaning of obligation, permission and prohibition. We also show how our language captures most of the intuitive desirable properties of electronic contracts, as well as how it avoids most of the classical paradoxes of deontic logic. We finally show its applicability on a contract example.