Run-time monitoring of electronic contracts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5311 LNCS, Issue , 2008, Pages 397-407

  Kyas, Marcel ^a   Prisacariu, Cristian ^a   Schneider, Gerardo ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SPECIFICATION LANGUAGES;

CONDITIONAL OBLIGATION; ELECTRONIC CONTRACT; INTER-ORGANIZATIONAL RELATIONSHIPS; RUNTIME MONITORING; RUNTIMES; TRACE SEMANTICS;

ROBOTS;

EID: 56749091114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88387-6_34     Document Type: Conference Paper

References (18)

1. Bauer, A., Leucker, M., Schallhart, C.: Monitoring of real-time properties. In: ArunKumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 260-272. Springer, Heidelberg (2006)
2. Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114-133 (1981)
3. Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Formal Methods in System Design 24(2), 101-127 (2004)
4. Fischer, M.J., Ladner, R.E.: Propositional modal logic of programs. In: STOC 1977, pp. 286-294. ACM, New York (1977)
5. Göller, S., Lohrey, M., Lutz, C.: PDL with Intersection and Converse Is 2 EXP-Complete. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 198-212. Springer, Heidelberg (2007)
6. Harel, D., Tiuryn, J., Kozen, D.: Dynamic Logic. MIT Press, Cambridge (2000)
7. Kozen, D.: A completeness theorem for kleene algebras and the algebra of regular events. Information and Computation 110(2), 366-390 (1994)
8. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM 47(2), 312-360 (2000)
9. Manna, Z., Pnueli, A.: Specification and verification of concurrent programs by ∀-automata. In: POPL 1987, pp. 1-12 (1987)
10. Muller, D.E., Saoudi, A., Schupp, P.E.: Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In: LICS 1988, pp. 422-427 (1988)
11. Pratt, V.R.: Process logic. In: POPL 1979, pp. 93-100. ACM Press, New York (1979)
12. Prisacariu, C., Schneider, G.: A formal language for electronic contracts. In: Bonsangue, M.M., Johnsen, E.B. (eds.) FMOODS 2007. LNCS, vol. 4468, pp. 174-189. Springer, Heidelberg (2007)
13. Prisacariu, C., Schneider, G.: CL: A Logic for Reasoning about Legal Contracts - Semantics. Technical Report 371, Univ. Oslo (2008)
14. Prisacariu, C., Schneider, G.: Run-time Monitoring of Electronic Contracts - theoretical results. Technical report, Univ. Oslo (2008)
15. Stolz, V., Bodden, E.: Temporal Assertions Using AspectJ. In: RV 2005. ENTCS, vol. 144, pp. 109-124. Elsevier, Amsterdam (2006)
16. Vardi, M.Y.: Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 191-206. Springer, Heidelberg (1997)
17. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: LICS 1986, pp. 332-344 (1986)
18. von Wright, G.H.: Deontic logic. Mind 60, 1-15 (1951)