The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems

Since its inception as a student project in 2001, initially just for the handling (as the name implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved and extended by joining scrupulous research on the theoretical foundations of (possibly non-convex) numerical abstractions to a total adherence to the best available practices in software development. Even though it is still not fully mature and functionally complete, the Parma Polyhedra Library already offers a combination of functionality, reliability, usability and performance that is not matched by similar, freely available libraries. In this paper, we present the main features of the current version of the library, emphasizing those that distinguish it from other similar libraries and those that are important for applications in the field of analysis and verification of hardware and software systems.Comment: 38 pages, 2 figures, 3 listings, 3 table

Cellular IP₆ Levels Limit HIV Production while Viruses that Cannot Efficiently Package IP₆ Are Attenuated for Infection and Replication

Summary: HIV-1 hijacks host proteins to promote infection. Here we show that HIV is also dependent upon the host metabolite inositol hexakisphosphate (IP6) for viral production and primary cell replication. HIV-1 recruits IP6 into virions using two lysine rings in its immature hexamers. Mutation of either ring inhibits IP6 packaging and reduces viral production. Loss of IP6 also results in virions with highly unstable capsids, leading to a profound loss of reverse transcription and cell infection. Replacement of one ring with a hydrophobic isoleucine core restores viral production, but IP6 incorporation and infection remain impaired, consistent with an independent role for IP6 in stable capsid assembly. Genetic knockout of biosynthetic kinases IPMK and IPPK reveals that cellular IP6 availability limits the production of diverse lentiviruses, but in the absence of IP6, HIV-1 packages IP5 without loss of infectivity. Together, these data suggest that IP6 is a critical cofactor for HIV-1 replication

Labelled transition systems as a Stone space

A fully abstract and universal domain model for modal transition systems and refinement is shown to be a maximal-points space model for the bisimulation quotient of labelled transition systems over a finite set of events. In this domain model we prove that this quotient is a Stone space whose compact, zero-dimensional, and ultra-metrizable Hausdorff topology measures the degree of bisimilarity such that image-finite labelled transition systems are dense. Using this compactness we show that the set of labelled transition systems that refine a modal transition system, its ''set of implementations'', is compact and derive a compactness theorem for Hennessy-Milner logic on such implementation sets. These results extend to systems that also have partially specified state propositions, unify existing denotational, operational, and metric semantics on partial processes, render robust consistency measures for modal transition systems, and yield an abstract interpretation of compact sets of labelled transition systems as Scott-closed sets of modal transition systems.Comment: Changes since v2: Metadata updat

Annotated revision programs

Revision programming is a formalism to describe and enforce updates of belief sets and databases. That formalism was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantify the confidence (probability) that a revision atom holds. The main goal of our paper is to reexamine the work of Fitting, argue that his semantics does not always provide results consistent with intuition, and to propose an alternative treatment of annotated revision programs. Our approach differs from that proposed by Fitting in two key aspects: we change the notion of a model of a program and we change the notion of a justified revision. We show that under this new approach fundamental properties of justified revisions of standard revision programs extend to the annotated case.Comment: 30 pages, to appear in Artificial Intelligence Journa