In this paper we study time-bounded verification of a finite continuoustime Markov chain (CTMC) C against a real-time specification, provided either as a metric temporal logic (MTL) property φ, or as a timed automaton (TA) A. The key question is: what is the probability of the set of timed paths of C that satisfy φ (or are accepted by A) over a time interval of fixed, bounded length? We provide...

This paper presents a new methodology for model checking real-time systems based on the abstraction of time predicates. A real-time system is modeled with a timed automaton which is translated to a real-time program. The properties are specified with the temporal logic TCTL (Timed Computational Tree Logic). The real-time program and the TCTL property are used first, for producing a new automato...

We address the problem of checking properties of Time Transition Systems (TTS), a generalization of Time Petri Nets with data variables and priorities. We are specifically interested by time-related properties expressed using real-time specification patterns, a language inspired by properties commonly found during the analysis of reactive systems. Our verification approach is based on the use o...

Overview To build robust, reliable autonomous systems, we have been developing the CIRCA approach to real-time intelligent control. Our goal is to give a CIRCAcontrolled autonomous system models of what it can do, what its goals are, and what the environment can do. From those models, we want CIRCA to automatically generate and execute hard-real-time controllers that are guaranteed to avoid fai...

In this paper, we study the problem of automatically verifying higherorder masking countermeasures. This problem is important in practice (weaknesses have been discovered in schemes that were thought secure), but is inherently exponential: for t-order masking, it involves proving that every subset of t intermediate variables is distributed independently of the secrets. Some type systems have be...

Verifying whether a building block conforms to a specific interface protocol is one of the important steps in a platform-based system-on-a-chip design methodology. There are limitations for most of the existing methods for interface protocol compliance verification. Simulation-based methods have the false positive problem while formal property checking methods may suffer from memory explosion a...

Ontology verification is concerned with the relationship between the intended structures for an ontology and the models of the axiomatization of the ontology. The verification of a particular ontology requires characterization of the models of the ontology up to isomorphism and a proof that these models are equivalent to the intended structures for the ontology. In this paper we provide the ver...

We report the first formal verification of a reintegration protocol for a safety-critical, fault-tolerant, real-time distributed embedded system. A reintegration protocol increases system survivability by allowing a node that has suffered a fault to regain state consistent with the operational nodes. The protocol is verified in the Symbolic Analysis Laboratory (SAL), where bounded model checkin...

Automated signature verification is an important capability when doing fraud detection from high volumes of document images. The challenge is mainly caused by the combination of inherent writer variations and the conscious attention placed by the fraudster on imitating a legitimate signature. Getting good signature references is the first and most important step affecting verification accuracy....