Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces

Genon, Alexandre; Massart, Thierry; Meuter, Cédric

doi:10.1007/11813040_37

Cited by 16 publications

(9 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As already mentioned, the implementation described in this paper is capable of generating logging specifications for distributed databases. Other related works on auditing based on policies expressed in temporal logics include [10], [11], [12]. [10] and [11] consider totally and partially ordered actions respectively, and policies expressed in propositional temporal logic.…”

Section: Related Workmentioning

confidence: 99%

“…Other related works on auditing based on policies expressed in temporal logics include [10], [11], [12]. [10] and [11] consider totally and partially ordered actions respectively, and policies expressed in propositional temporal logic. As their policy language is less expressive than MFOTL, our work is clearly applicable for any policies considered in those works.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Transforming Privacy Policies to Auditing Specifications

Biswas¹,

Niemi²

2011

2011 IEEE 13th International Symposium on High-Assurance Systems Engineering

View full text Add to dashboard Cite

With more and more personal data being collected and stored by service providers, there is an increasing need to ensure that their usage is compliant with privacy regulations. We consider the specific scenario where policies are defined in metric temporal logic and audited against the database usage logs. Previous works have shown that this can indeed be achieved in an efficient manner for a very expressive set of policies. One of the main ingredients of such an auditing process is the availability of sufficient database logs. Currently, it is a manual process to first determine the logs needed, and then come up with the necessary auditing specifications to generate them. This is not only a time consuming process but can be erroneous as well, leading to either insufficient or redundant logging. Logging in general is costly as it is an overhead on the real-time database performance, and hence redundant logging is not an alternative either.Our contribution in this work is to streamline the log generation process by deriving the auditing specifications directly from the policies to be audited. We also show how the required logging can be minimized based on the temporal constraints specified in the policies. Given privacy policies as input, the output of the proposed tool is the corresponding auditing specifications that can be installed directly in the databases, to produce logs that are both minimal and sufficient to audit the given policies. The tool has been implemented and tested in a real-life scenario.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Transforming Privacy Policies to Auditing Specifications

Biswas¹,

Niemi²

2011

2011 IEEE 13th International Symposium on High-Assurance Systems Engineering

View full text Add to dashboard Cite

show abstract

“…The authors provide an explicit exploration of the state space and to limit this exploration a window is used. In a previous work [35], we have used this technique to provide an efficient Ltl tester of distributed executions.…”

Section: Related Workmentioning

confidence: 99%

Testing Distributed Systems Through Symbolic Model Checking

Kalyon

Massart

Meuter

et al. 2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The observation of a distributed system's finite execution can be abstracted as a partial ordered set of events generally called finite (partial order) trace. In practice, this trace can be obtained through a standard code instrumentation, which takes advantage of existing communications between processes to partially order events of different processes. We show that testing that such a distributed execution satisfies some global property amounts therefore to model check the corresponding trace. This work can be time consuming; we therefore provide an efficient symbolic Ctl model-checking algorithm for traces. This method is based on a symbolic data structure, called Interval Sharing Trees, allowing to efficiently represent and manipulate sets of k-uples of naturals. Efficient symbolic operations are defined on this data structure in order to deal with all Ctl modalities. We show that in practice this data structure is well adapted for Ctl model checking of traces.

show abstract

“…For the specific case of relaxed memory models, [11] presents a technique for monitoring that a program has no executions violating sequential consistency. There is also work [19] that targets physically distributed systems, but does not focus on distributed monitoring.…”

Section: Introductionmentioning

confidence: 99%

On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems

Fraigniaud

Rajsbaum

Travers

2014

Runtime Verification

View full text Add to dashboard Cite

Decentralized runtime monitoring involves a set of monitors observing the behavior of system executions with respect to some correctness property. It is generally assumed that, as soon as a violation of the property is revealed by any of the monitors at runtime, some recovery code can be executed for bringing the system back to a legal state. This implicitly assumes that each monitor produces a binary opinion, true or false, and that the recovery code is launched as soon as one of these opinions is equal to false. In this paper, we formally prove that, in a failure-prone asynchronous computing model, there are correctness properties for which there is no such decentralized monitoring. We show that there exist some properties which, in order to be monitored in a wait-free decentralized manner, inherently require that the monitors produce a number of opinions larger than two. More specifically, our main result is that, for every k, 1 ≤ k ≤ n, there exists a property that requires at least k opinions to be monitored by n monitors. We also present a corresponding distributed monitor using at most k + 1 opinions, showing that our lower bound is nearly tight.

show abstract

Monitoring Distributed Controllers: When an Efficient LTL Algorithm on Sequences Is Needed to Model-Check Traces

Cited by 16 publications

References 36 publications

Transforming Privacy Policies to Auditing Specifications

Transforming Privacy Policies to Auditing Specifications

Testing Distributed Systems Through Symbolic Model Checking

On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems

Contact Info

Product

Resources

About