Transfer protocols are composed from basic protocol mechanisms and accordingly a complex protocol can be veriied by a series of relatively simple mechanism proofs. Our approach applies L. Lamport's Temporal Logic of Actions (TLA). It is based on a modular compositional TLA-style and supports the analysis of exibly conngured high-speed transfer protocols.

The differential temporal dynamic logic dTL is a logic to specify temporal properties of hybrid systems. It combines differential dynamic logic with temporal logic to reason about the intermediate states reached by a hybrid system. The logic dTL supports some linear time temporal properties of LTL. It extends differential temporal dynamic logic dTL with nested temporalities. We provide a semant...

We show that propositional linear temporal logic with knowledge modalities but without common knowledge has an undecidable satisfiability problem when interpreted in a ‘concrete’ semantics with perfect recall or with perfect recall and synchrony. We then conclude that this concrete semantics is not axiomatizable in the semantics, based on local states.

To obtain an expressively complete linear-time temporal logic (LTL) over Mazurkiewicz traces that is computationally tractable, we need to intepret formulas locally, at individual events in a trace, rather than globally, at configurations. Such local logics necessarily require past modalities, in contrast to the classical setting of LTL over sequences. Earlier attempts at defining expressively ...

Temporal logic is obtained by adding temporal connectives to a logic language. Explicit references to time are hidden inside the temporal connectives. Di erent variants of temporal logic use di erent sets of such connectives. In this chapter, we survey the fundamental varieties of temporal logic and describe their applications in information systems. Several features of temporal logic make it e...

Temporal logic is obtained by adding temporal connectives to a logic language. Explicit references to time are hidden inside the temporal connectives. Different variants of temporal logic use different sets of such connectives. In this chapter, we survey the fundamental varieties of temporal logic and describe their applications in information systems. Several features of temporal logic make it...

This paper presents a framework for compositional verification of Object-Z specifications. Its key feature is a proof rule based on decomposition of hierarchical Object-Z models. For each component in the hierarchy local properties are proven in a single proof step. However, we do not consider components in isolation. Instead, components are envisaged in the context of the referencing super-com...

We explore of use of the tool BeepBeep, a monitor for the temporal logic LTL-FO+, in interpreting assembly traces, focusing on security-related applications. LTL-FO+ is an extension of LTL, which includes first order quantification. We show that LTL-FO+ is a sufficiently expressive formalism to state a number of interesting program behaviors, and demonstrate experimentally that BeepBeep can eff...