Learn More
In this paper we propose a formal language for writing electronic contracts, based on the deontic notions of obligation, permission, and prohibition. We take an ought-to-do approach, where deontic operators are applied to actions instead of state-of-aairs. We propose an extension of the µ-calculus in order to capture the intuitive meaning of the deontic(More)
Given the intractability of exhaustively verifying software, the use of runtime-verification, to verify single execution paths at run-time, is becoming popular. Although the use of runtime verification is increasing in industrial settings, various challenges still are to be faced to enable it to spread further. We present dynamic communicating au-tomata(More)
We formalise the semantics of V ? , a simple version of Verilog hardware description language using an extension of Duration Calculus. The language is simple enough for experimenting formalisation, but contains suucient features for being practically relevant. V ? programs can exhibit a rich variety of computations, and it is therefore necessary to extend(More)
In this paper we develop an algorithm for solving the reach-ability problem of two-dimensional piece-wise rectangular differential inclusions . Our procedure is not based on the computation of the reach-set but rather on the computation of the limit of individual trajectories. A key idea is the use of one-dimensional affine Poincaré maps for which we can(More)
In this work we are concerned with the formal verification of two-dimensional non-deterministic hybrid systems, namely polygonal differential inclusion systems (SPDIs). SPDIs are a class of nondeterministic systems that correspond to piece-wise constant differential inclusions on the plane, for which we study the reachability problem. Our contribution is(More)
We present a certified algorithm for resource usage analysis, applicable to languages in the style of Java byte code. The algorithm verifies that a program executes in bounded memory. The algorithm is destined to be used in the development process of applets and for enhanced byte code verification on embedded devices. We have therefore aimed at a(More)
The use of runtime verification, as a lightweight approach to guarantee properties of systems, has been increasingly employed on real-life software. In this paper, we present the tool LARVA, for the runtime verification of properties of Java programs, including real-time properties. Properties can be expressed in a number of notations, including(More)