Specification and verification of concurrent programs by A∀automata
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Journal of the ACM (JACM)
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Dynamic Logic
Process logic: preliminary report
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Checking Finite Traces Using Alternating Automata
Formal Methods in System Design
Temporal Assertions using AspectJ
Electronic Notes in Theoretical Computer Science (ENTCS)
PDL with intersection and converse is 2EXP-complete
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
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
Monitoring of real-time properties
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
$\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
CLAN: A Tool for Contract Analysis and Conflict Discovery
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
A formal framework for specifying and analyzing logs as electronic evidence
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Querying contract databases based on temporal behavior
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Normative monitoring: semantics and implementation
COIN@AAMAS'10 Proceedings of the 6th international conference on Coordination, organizations, institutions, and norms in agent systems
When the requirements for adaptation and high integrity meet
Proceedings of the 8th workshop on Assurances for self-adaptive systems
Self-adaptive software needs quantitative verification at runtime
Communications of the ACM
| Hi-index | 0.02 |
Electronic inter-organizational relationships are governed by contracts regulating their interaction, therefore it is necessary to run-time monitor the contracts, as to guarantee their fulfillment. The present work shows how to obtain a run-time monitor for contracts written in $\mathcal {CL}$, a formal specification language which allows to write conditional obligations, permissions, and prohibitions over actions. The trace semantics of $\mathcal {CL}$ formalizes the notion of a trace fulfills a contract. We show how to obtain, for a given contract, an alternating Büchi automaton which accepts exactly the traces that fulfill the contract. This automaton is the basis for obtaining a finite state machine which acts as a run-time monitor for $\mathcal {CL}$ contracts.