interpretation and infinite state model checking In abstract interpretation we develop an abstract semantic function systematically from the standard (“concrete”) semantics. The formal framework is based on a Galois connection 〈L,vL〉 −−−→ ←−−− α γ 〈M,vM 〉 between the lattices 〈L,vL〉 and 〈M,vM 〉 which are the concrete and abstract semantic domains respectively. The functions α and γ are known as...

Let A and B be Banach algebras with bounded approximate identities let Φ:A→B a surjective continuous linear map which preserves two-sided zero products (i.e., Φ(a)Φ(b)=Φ(b)Φ(a)=0 whenever ab=ba=0). We show that Φ is weighted Jordan homomorphism provided product determined weakly amenable. These conditions are in particular fulfilled when the group algebra L1(G) G any locally compact group. also...

This paper defines the cover of a formula φ with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by ∃V : φ in theory T . Cover exists for several useful theories, including those that do not admit quantifier elimination. This paper describes cover algorithms for the theories of uninterpreted functions and linear arithmetic. In addition, th...

We present an approach, based on model-driven verifying compilation, to construct distributed applications that satisfy userspecified safety specifications, assuming a ”synchronous network” model of computation. Given a distributed application Pd and a safety specification φ in a domain specific language dasl (that we have developed), we first use a combination of sequentialization and software...

The language PSL [1] is a temporal logic standardized by the Accellera standards organization and currently undergoing the process of becoming an IEEE standard. The core of PSL, denoted here LTL WR, is an extension of the linear temporal logic LTL. The extension takes two orthogonal directions. In one direction the logic is interpreted over finite, possibly truncated, as well as infinite words....

This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent probabilistic systems as models; these allow nondeterministic choice between probability distributions and are particularly well suited to modelling distributed systems with probabilistic behaviour, e.g. randomized c...

We introduce Normative Temporal Logic (NTL), a logic for reasoning about normative systems. NTL is a generalisation of the well-known branchingtime temporal logic CTL, in which the path quantifiers A (“on all paths. . . ”) and E (“on some path. . . ”) are replaced by the indexed deontic operators Oη and Pη, where for example Oηφ means “φ is obligatory in the context of normative system η”. Afte...