Temporal Assertions using AspectJ

Stolz, Volker; Bodden, Eric

doi:10.1016/j.entcs.2006.02.007

Cited by 135 publications

(85 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…On the other hand a close look at the semantics of CL from Section 2 reveals the nice feature of this semantics which behaves the same for finite traces as for infinite traces. This coupled with the definition of alternating automata from Section 3 which accepts both infinite and finite traces gives the opportunity to investigate the use of alternating finite automata from [15] on the finite trace semantics. This may generate a monitor which is only single-exponential in size.…”

Section: Resultsmentioning

confidence: 99%

“…The paper presents several algorithms which work on alternating automata to check for word inclusion. In [15] LTL has semantics on finite traces and nondeterministic alternating finite automata are used to recog-nize these traces. A determinization algorithm for alternating automata is given which can be extended to our alternating Büchi automata.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Run-Time Monitoring of Electronic Contracts

Kyas

Prisacariu

Schneider

2008

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Abstract. Electronic inter-organizational relationships are governed by contracts regulating their interaction. 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 CL, a formal specification language which allows to write conditional obligations, permissions and prohibitions over actions. The trace semantics of 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 CL contracts.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Run-Time Monitoring of Electronic Contracts

Kyas

Prisacariu

Schneider

2008

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

show abstract

“…LOGSCOPE furthermore adds a temporal logic with sequencing, and translates it into the automaton subset. Several systems exist supporting different logics, such as past time temporal logic [13], future time temporal logic [19], regular expressions [1], and state charts [10]. The MOP system [9] implements a series of such traditional logics as separate plugins, but within the same framework.…”

Section: A Little Historymentioning

confidence: 99%

Rule Systems for Runtime Verification: A Short Tutorial

Barringer

Havelund

Rydeheard

et al. 2009

Runtime Verification

View full text Add to dashboard Cite

Abstract. In this tutorial, we introduce two rule-based systems for on and offline trace analysis, RULER and LOGSCOPE. RULER is a conditional rule-based system, which has a simple and easily implemented algorithm for effective runtime verification, and into which one can compile a wide range of temporal logics and other specification formalisms used for runtime verification. Specifications can be parameterized with data, or even with specifications, allowing for temporal logic combinators to be defined. We outline a number of simple syntactic extensions of core RULER that can lead to further conciseness of specification but still enabling easy and efficient implementation. RuleR is implemented in Java and we will demonstrate its ease of use in monitoring Java programs. LOGSCOPE is a derivation of RULER adding a simple very user-friendly temporal logic. It was developed in Python, specifically for supporting testing of spacecraft flight software for NASA's next 2011 Mars mission MSL (Mars Science Laboratory). The system has been applied by test engineers to analysis of log files generated by running the flight software. Detailed logging is already part of the system design approach, and hence there is no added instrumentation overhead caused by this approach. While post-mortem log analysis prevents the autonomous reaction to problems possible with traditional runtime verification, it provides a powerful tool for test automation. A new system is being developed that integrates features from both RULER and LOGSCOPE.

show abstract

“…A large number of formalisms have been proposed in recent years for supporting trace analysis, see for example [13,9,12,10,3,15,8]. Examples are temporal logics, including past time as well as future time, regular expressions, state machines, context free grammars, real-time logics, and statistics gathering logics.…”

Section: Introductionmentioning

confidence: 99%

TraceContract: A Scala DSL for Trace Analysis

Barringer

Havelund

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we describe TRACECONTRACT, an API for trace analysis, implemented in the SCALA programming language. We argue that for certain forms of trace analysis the best weapon is a high level programming language augmented with constructs for temporal reasoning. A trace is a sequence of events, which may for example be generated by a running program, instrumented appropriately to generate events. The API supports writing properties in a notation that combines an advanced form of data parameterized state machines with temporal logic. The implementation utilizes SCALA's support for defining internal Domain Specific Languages (DSLs). Furthermore SCALA's combination of object oriented and functional programming features, including partial functions and pattern matching, makes it an ideal host language for such an API.

show abstract

Temporal Assertions using AspectJ

Cited by 135 publications

References 13 publications

Run-Time Monitoring of Electronic Contracts

Run-Time Monitoring of Electronic Contracts

Rule Systems for Runtime Verification: A Short Tutorial

TraceContract: A Scala DSL for Trace Analysis

Contact Info

Product

Resources

About