Results 1 
9 of
9
Distributed Usage Control
 Communications of the ACM
, 2006
"... Computer systems play an increasingly prominent role in our daily lives. Interacting with these systems often involves disclosing personal data, i.e., data that can be traced back to particular individuals, collected in different contexts. For example, healthcare providers, insurance companies, and ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
(Show Context)
Computer systems play an increasingly prominent role in our daily lives. Interacting with these systems often involves disclosing personal data, i.e., data that can be traced back to particular individuals, collected in different contexts. For example, healthcare providers, insurance companies, and tax
Monitoring temporal properties of continuous signals
 In: Proceedings of FORMATSFTRTFT. Volume 3253 of LNCS
, 2004
"... Abstract. In this paper we introduce a variant of temporal logic tailored for specifying desired properties of continuous signals. The logic is based on a bounded subset of the realtime logic MITL, augmented with a static mapping from continuous domains into propositions. From formulae in this logi ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
Abstract. In this paper we introduce a variant of temporal logic tailored for specifying desired properties of continuous signals. The logic is based on a bounded subset of the realtime logic MITL, augmented with a static mapping from continuous domains into propositions. From formulae in this logic we create automatically property monitors that can check whether a given signal of bounded length and finite variability satisfies the property. A prototype implementation of this procedure was used to check properties of simulation traces generated by Matlab/Simulink. 1
Realtime Property Preservation in Approximations of Timed Systems
 In: Proceedings of the 1st ACM & IEEE International Conference on Formal Methods and Models for CoDesign
, 2003
"... Formal techniques have been widely applied in the design of realtime systems and have significantly helped detect design errors by checking realtime properties of the model. However, a model is only an approximation of its realization in terms of the issuing time of events. Therefore, a realtime ..."
Abstract

Cited by 17 (12 self)
 Add to MetaCart
(Show Context)
Formal techniques have been widely applied in the design of realtime systems and have significantly helped detect design errors by checking realtime properties of the model. However, a model is only an approximation of its realization in terms of the issuing time of events. Therefore, a realtime property verified in the model can not always be directly transferred to the realization. In this paper, both the model and the realization are viewed as sets of timed state sequences. In this context, we first investigate the realtime property preservation between two neighbouring timed state sequences (execution traces of timed systems), and then extend the results to two "neighbouring" timed systems. The study of realtime property preservation gives insight in building a formal link between realtime properties satisfied in the model and those in the realization.
Checking Temporal Business Rules
 In: Proceedings of the First International REA Workshop
, 2004
"... In this paper we describe an eventbased algorithm for runtime verification of timed linear temporal logic. The algorithm is based on a rewriting of the formula expressing a desired or undesired property of a timed system. Rewriting takes place, at discrete points in time, but only when there is ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper we describe an eventbased algorithm for runtime verification of timed linear temporal logic. The algorithm is based on a rewriting of the formula expressing a desired or undesired property of a timed system. Rewriting takes place, at discrete points in time, but only when there is a relevant statechange taking place in the timed system, or a deadline, determined by the formula, has been passed. By limiting the rewriting to only points in time where an event occurs, and not at all discrete timepoints, makes the algorithm useful in situations where there are large data sets and large di#erences in the relevant time scales (ranging perhaps from milliseconds to months as in business software).
2.1 Yet Another MTL Variant...................... 9 2.1.1 MTL Syntax and Semantics................. 9
, 2007
"... This paper presents a verification technique for densetime MTL based on discretization. The technique reduces the validity problem of MTL formulas from dense to discrete time, through the notion of sampling invariance, introduced in previous work [FR06]. Since the reduction is from an undecidable p ..."
Abstract
 Add to MetaCart
This paper presents a verification technique for densetime MTL based on discretization. The technique reduces the validity problem of MTL formulas from dense to discrete time, through the notion of sampling invariance, introduced in previous work [FR06]. Since the reduction is from an undecidable problem to a decidable one, the technique is necessarily incomplete, so it fails to provide conclusive answers on some problem instances. The paper discusses this shortcoming and hints at how it can be mitigated in practice. The verification technique has been implemented on top of a tool for discretetime bounded validity checking; the paper also reports on inthesmall experiments with the tool, which show some
MonitorBased Statistical Model Checking for Weighted Metric Temporal Logic
, 2012
"... Abstract. We present a novel approach and implementation for analysing weighted timed automata (WTA) with respect to the weighted metric temporal logic (WMTL≤). Based on a stochastic semantics of WTAs, we apply statistical model checking (SMC) to estimate and test probabilities of satisfaction with ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We present a novel approach and implementation for analysing weighted timed automata (WTA) with respect to the weighted metric temporal logic (WMTL≤). Based on a stochastic semantics of WTAs, we apply statistical model checking (SMC) to estimate and test probabilities of satisfaction with desired levels of confidence. Our approach consists in generation of deterministic monitors for formulas in WMTL≤, allowing for efficient SMC by runtime evaluation of a given formula. By necessity, the deterministic observers are in general approximate (over or underapproximations), but are most often exact and experimentally tight. The technique is implemented in the new tool Casaal that we seamlessly connect to Uppaalsmc in a tool chain. We demonstrate the applicability of our technique and the efficiency of our implementation through a number of casestudies. 1
RV'04 Preliminary Version Monitoring Algorithms for Metric Temporal Logic Specifications
, 2004
"... Abstract Program execution traces can be so large in practical testing and monitoring applications that it would be very expensive, if not impossible, to store them for detailed analysis. Monitoring execution traces without storing them, can be a nontrivial matter for many specification formalisms, ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract Program execution traces can be so large in practical testing and monitoring applications that it would be very expensive, if not impossible, to store them for detailed analysis. Monitoring execution traces without storing them, can be a nontrivial matter for many specification formalisms, because complex formulae may require a considerable amount of information about the past. Metric temporal logic (MTL) is an extension of propositional linear temporal logic with discretetimebounded temporal operators. In MTL, one can specify time limits within which certain temporal properties must hold, thus making it very suitable to express realtime monitoring requirements. In this paper, we present monitoring algorithms for checking timestamped execution traces against formulae in MTL or certain important sublogics of it. We also present lower bounds for the monitoring problem, showing that the presented algorithms are asymptotically optimal. 1 Introduction Runtime verification and monitoring have been proposed as lightweight formal verification methods [13] with the explicit goal of checking systems against their formal requirements while they execute. In most monitoring applications, execution traces are available only incrementally and they are much larger than the formulae against which they are checked. Storing an entire execution trace and then performing the formal analysis by having random access to the trace is very expensive and sometimes even impossible. For example, the monitor may lack resources, e.g., if it runs within an embedded system, or the monitor may be expected to react promptly when its requirements are violated, in order for the system to safely take a recovery or a shutdown action. In this paper, we adopt the position that a monitoring algorithm does not store execution traces, but rather consumes the events as they are reThis is a preliminary version. The final version will be published inElectronic Notes in Theoretical Computer Science
Abstract RV’04 Preliminary Version Monitoring Algorithms for Metric Temporal Logic Specifications
"... Program execution traces can be so large in practical testing and monitoring applications that it would be very expensive, if not impossible, to store them for detailed analysis. Monitoring execution traces without storing them, can be a nontrivial matter for many specification formalisms, because c ..."
Abstract
 Add to MetaCart
(Show Context)
Program execution traces can be so large in practical testing and monitoring applications that it would be very expensive, if not impossible, to store them for detailed analysis. Monitoring execution traces without storing them, can be a nontrivial matter for many specification formalisms, because complex formulae may require a considerable amount of information about the past. Metric temporal logic (MTL) is an extension of propositional linear temporal logic with discretetimebounded temporal operators. In MTL, one can specify time limits within which certain temporal properties must hold, thus making it very suitable to express realtime monitoring requirements. In this paper, we present monitoring algorithms for checking timestamped execution traces against formulae in MTL or certain important sublogics of it. We also present lower bounds for the monitoring problem, showing that the presented algorithms are asymptotically optimal. 1
Genie Informatique, Ecole Polytechnique de Montreal
"... Formal methods have been advocated for the verification of digital design where correctness is proved mathematically. In contrast to digital designs, the verification of analog and mixed signal systems is a challenging task that requires lots of expertise and deep understanding of their behavior. In ..."
Abstract
 Add to MetaCart
Formal methods have been advocated for the verification of digital design where correctness is proved mathematically. In contrast to digital designs, the verification of analog and mixed signal systems is a challenging task that requires lots of expertise and deep understanding of their behavior. In this paper, we present a runtime verification methodology based on monitoring the behavior (solution flow) of analog circuits. Monitors are deterministic timed automata that can be synthesized from temporal properties. For illustration purposes, we applied our methodology on the verification of the oscillation property of a tunnel diode oscillator.