$\mathcal{CL}$: An Action-Based Logic for Reasoning about Contracts

Authors:
Cristian Prisacariu;Gerardo Schneider
Affiliations:
Department of Informatics, University of Oslo, Oslo, Norway N-0316;Department of Informatics, University of Oslo, Oslo, Norway N-0316
Venue:
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Year:
2009

Citing 13
Cited 0

Concurrent dynamic logic

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The foundations of Esterel

Proof, language, and interaction
Modal logic

Modal logic
Dynamic Logic

Dynamic Logic
Finite Models for Deterministic Propositional Dynamic Logic

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Propositional Dynamic Logic of Flowcharts

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Propositional modal logic of programs

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A Fixed-point Characterization of a Deontic Logic of Regular Action

Fundamenta Informaticae - Deontic Logic in Computer Science
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
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
A complete and compact propositional deontic logic

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new version of the $\mathcal{CL}$ contract specification language. $\mathcal{CL}$ combines deontic logic with propositional dynamic logic but it applies the modalities exclusively over structured actions. $\mathcal{CL}$ features synchronous actions, conflict relation, and an action negation operation. The $\mathcal{CL}$ version that we present here is more expressive and has a cleaner semantics than its predecessor. We give a direct semantics for $\mathcal{CL}$ in terms of normative structures . We show that $\mathcal{CL}$ respects several desired properties from legal contracts and is decidable. We relate this semantics with a trace semantics of $\mathcal{CL}$ which we used for run-time monitoring contracts.