Monitoring of temporal first-order properties with aggregations

Basin, David; Klaedtke, Felix; Marinovic, Srdjan; Zălinescu, Eugen

doi:10.1007/s10703-015-0222-7

Cited by 57 publications

(45 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Summary structures (future formulas) précis no online yes no reduce [4] yes offline no no Chomicki [8,9] no online yes no Krukow et al [10] Bauer et al [11] yes online yes no Basin et al [5,7] no online yes yes Basin et al [6] yes online yes yes Bauer et al [19] no online (automata)* (automata)* Table 1: Comparison of design choices in précis and prior work using first-order temporal logic for privacy compliance. *Automata-based approaches have no explicit notion of summary structures.…”

Section: Implementation and Evaluationmentioning

confidence: 99%

“…To address this limitation, many logics and languages have been proposed for specifying privacy policies. Some examples are P3P [48,49], EPAL [50,51], Privacy APIs [52], LPU [53,54], past-only fragment of first-order temporal logic (FOTL) [10,11], predLTL [55], pLogic [56], PrivacyLFP [12], MFOTL [5][6][7], the guarded fragment of first-order logic with explicit time [4], and P-RBAC [57]. Our policy language, GMP, is more expressive than many existing policy languages such as LPU [53,54], P3P [48,49], EPAL [50,51], and P-RBAC [57].…”

Section: Related Workmentioning

confidence: 99%

“…Alternatively, an online program may monitor privacy-relevant events, check them against the prevailing privacy policy and report violations on the fly. Both approaches have been considered in literature: An algorithm for offline compliance checking has been proposed by a subset of the authors [4], whereas online monitoring has been the subject of extensive work by other researchers [5][6][7][8][9][10][11].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Chowdhury

Jia

Garg³

et al. 2014

Computer Aided Verification

View full text Add to dashboard Cite

Fragments of first-order temporal logic are useful for representing many practical privacy and security policies. Past work has proposed two strategies for checking event trace (audit log) compliance with policies: online monitoring and offline audit. Although online monitoring is space-and timeefficient, existing techniques insist that satisfying instances of all subformulas of the policy be amenable to caching, which limits expressiveness when some subformulas have infinite support. In contrast, offline audit is brute force and can handle more policies but is not as efficient. This paper proposes a new online monitoring algorithm that caches satisfying instances when it can, and falls back to the brute force search when it cannot. Our key technical insight is a new flowand time-sensitive static check of variable groundedness, called the temporal mode check, which determines subformulas for which such caching is feasible and those for which it is not and, hence, guides our algorithm. We prove the correctness of our algorithm and evaluate its performance over synthetic traces and realistic policies.

show abstract

Section: Implementation and Evaluationmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Chowdhury

Jia

Garg³

et al. 2014

Computer Aided Verification

View full text Add to dashboard Cite

show abstract

“…As per the standard lifting, interpretations must be extended to interpret function and predicate symbols, thus leading to additional information being added to the trace as in [15,25]. Although we note that it is unusual to do this in practice.…”

Section: Traces As Modelsmentioning

confidence: 99%

What Is a Trace? A Runtime Verification Perspective

Reger

Havelund

2016

Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications

View full text Add to dashboard Cite

Abstract. Runtime Monitoring or Verification deals with traces. In its most simple form a monitoring system takes a trace produced by a system and a specification of correct behaviour and checks if the trace conforms to the specification. More complex applications may introduce notions of feedback and reaction. The notion that unifies the field is that we can abstract the runtime behaviour of a system by an execution trace and check this for conformance. However, there is little uniform understanding of what a trace is. This is most keenly seen when comparing theoretical and practical work. This paper surveys the different notions of trace and reflects on the related issues.

show abstract

“…Basin et al [14] extend the metric first-order temporal logic (MFOTL) with aggregation operators in order to specify observers that represent the compliance policies on aggregated data. Compliance policies represent normative regulations, which specify permissive and obligatory actions for system users.…”

Section: B Observer Specificationmentioning

confidence: 99%

The observer-based technique for requirements validation in embedded real-time systems

Zhou

Lundqvist

2014

2014 IEEE 1st International Workshop on Requirements Engineering and Testing (RET)

View full text Add to dashboard Cite

Abstract-Model-based requirements validation is an increasingly attractive approach to discovering hidden flaws in requirements in the early phases of systems development life cycle. The application of using traditional methods such as model checking for the validation purpose is limited by the growing complexity of embedded real-time systems (ERTS). The observer-based technique is a lightweight validation technique, which has shown its potential as a means of validating the correctness of model behaviors. In this paper, the novelty of our contributions is threefold: 1) we formally define the observer constructs for our formal specification language namely the Timed Abstract State Machine (TASM) language and, 2) we propose the Events Monitoring Logic (EvML) to facilitate the observer specification and, 3) we show how to execute observers to validate the requirements describing the functional behaviors and non-functional properties (such as timing) of ERTS. We also illustrate the applicability of the extended TASM language through an industrial application of a Vehicle Locking-Unlocking system.

show abstract

Monitoring of temporal first-order properties with aggregations

Cited by 57 publications

References 23 publications

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

Temporal Mode-Checking for Runtime Monitoring of Privacy Policies

What Is a Trace? A Runtime Verification Perspective

The observer-based technique for requirements validation in embedded real-time systems

Contact Info

Product

Resources

About