We define a framework based on computational logic technology and on a reactive axiomatization of the Event Calculus to formalize the evolution of commitments in time. We propose a new characterization of commitments with time that enables a rich modeling of the domain, various forms of reasoning, and run-time and static verification.

We define a framework based on computational logic technology and on a reactive axiomatization of the Event Calculus to formalize the evolution of commitments in time. We propose a new characterization of commitments with time that enables a rich modeling of the domain, various forms of reasoning, and run-time and static verification.

To make an event-triggered real-time system safe in application layer, this study presents a specification-based run-time verification (RV) and fault tolerance approach in following steps: i) System is isolated from its environment by modeling interaction between them; ii) Considering safety requirements violation, observation-verification-tolerance rules are systematically obtained; and iii) R...

We introduce the novel notion of quasi-equal clocks and use it to improve the verification time of networks of timed automata. Intuitively, two clocks are quasi-equal if, during each run of the system, they have the same valuation except for those points in time where they are reset. We propose a transformation that takes a network of timed automata and yields a network of timed automata which ...

Currently, security checks on Java Card applets are performed by a static verification process before executing an applet. A verified and later unmodified applet is not able to break the Java Card sand-box model. Unfortunately, this static verification process is not a countermeasure against physical run-time attacks corrupting the control or data flow of an applet. In this piece of work, desig...

The process of verifying that a program conforms to its specification is often hampered by errors in both the program and the specification. A runtime checker that can evaluate formal specifications can be useful for quickly identifying such errors. This paper describes our preliminary experience with incorporating run-time checking into the Jahob verification system and discusses some lessons ...

The present report continues the work of deliverable I2-D2 [Bonatti and Olmedilla, 2005b] by presenting a series of reasoning techniques, that allow several kinds of verifications, such as compliance at run-time, verification of properties, goal achievement, capability checking, and interoperability. We will show how techniques, that are typically used in artificial intelligence, can be usefull...

In this paper we propose a paradigm shift for the timedproperties representation, computation and verification, introducing a declarative approach. The proposed approach provides a flexible event calculus based composition design, that allows for modeling different aspects such as the local temporal constraints for Web services with different synchronization modes and the global temporal constr...

Assembling new software systems from prefabricated components is an attractive alternative to traditional software engineering practices and promises to increase reuse and reduce development costs. However, these benefits will only occur if separately developed components can be made to work effectively together with reasonable effort. Lengthy and costly in-situ verification and acceptance test...