A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm

The Automatic Dependent Surveillance-Broadcast (ADS-B) system allows aircraft to communicate their current state, including position and velocity information, to other aircraft in their vicinity and to ground stations. The Compact Position Reporting (CPR) algorithm is the ADS-B module responsible for the encoding and decoding of aircraft positions. CPR is highly sensitive to computer arithmetic since it heavily relies on functions that are intrinsically unstable such as floor and modulo. In this paper, a formally-verified double-precision floating-point implementation of the CPR algorithm is presented. The verification proceeds in three steps. First, an alternative version of CPR, which reduces the floating-point rounding error is proposed. Then, the Prototype Verification System (PVS) is used to formally prove that the ideal real-number counterpart of the improved algorithm is mathematically equivalent to the standard CPR definition. Finally, the static analyzer Frama-C is used to verify that the double-precision implementation of the improved algorithm is correct with respect to its operational requirement. The alternative algorithm is currently being considered for inclusion in the revised version of the ADS-B standards document as the reference implementation of the CPR algorithm

New results on rewrite-based satisfiability procedures

Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems, any theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure. We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating sufficient conditions for termination on a combinations of theories, given termination on each. The above theories, as well as others, satisfy these conditions. We introduce several sets of benchmarks on these theories and their combinations, including both parametric synthetic benchmarks to test scalability, and real-world problems to test performances on huge sets of literals. We compare the rewrite-based theorem prover E with the validity checkers CVC and CVC Lite. Contrary to the folklore that a general-purpose prover cannot compete with reasoners with built-in theories, the experiments are overall favorable to the theorem prover, showing that not only the rewriting approach is elegant and conceptually simple, but has important practical implications.Comment: To appear in the ACM Transactions on Computational Logic, 49 page

L-CMP: an automatic learning-based parameterized verification tool

This demo introduces L-CMP, an automatic learning-based parameterized verification tool. It can verify parameterized protocols by combining machine learning and model checking techniques. Given a parameterized protocol, L-CMP learns a set of auxiliary invariants and implements verification of the protocol using the invariants automatically. In particular, the learned auxiliary invariants are straightforward and readable. The experimental results show that L-CMP can successfully verify a number of cache coherence protocols, including the industrial-scale FLASH protocol. The video presentation of L-CMP is available at https://youtu.be/6Dl2HiiiS4E, and the source code can be downloaded at https://github.com/ArabelaTso/Learning-Based-ParaVerifer. © 2018 Copyright held by the owner/author(s). Publication rights licensed to ACM

BSP Functional Programming: Examples of a Cost Based Methodology

Abstract. Bulk-Synchronous Parallel ML (BSML) is a functional data-parallel language for the implementation of Bulk-Synchronous Parallel (BSP) algorithms. It makes an estimation of the execution time (cost) possible. This paper presents some general examples of BSML programs and a comparison of their predicted costs with the measured execution time on a parallel machine

Building better bit-blasting for floating-point problems

An effective approach to handling the theory of floating-point is to reduce it to the theory of bit-vectors. Implementing the required encodings is complex, error prone and requires a deep understanding of floating-point hardware. This paper presents SymFPU, a library of encodings that can be included in solvers. It also includes a verification argument for its correctness, and experimental results showing that its use in CVC4 out-performs all previous tools. As well as a significantly improved performance and correctness, it is hoped this will give a simple route to add support for the theory of floating-point

Extracting Symbolic Transitions from TLA+TLA+ Specifications

International audienceIn TLA+, a system specification is written as a logical formula that restricts the system behavior. As a logic, TLA+ does not have assignments and other imperative statements that are used by model checkers to compute the successor states of a system state. Model checkers compute successors either explicitly-by evaluating program statements-or symbolically-by translating program statements to an SMT formula and checking its satisfiability. To efficiently enumerate the successors, TLA's model checker TLC introduces side effects. For instance, an equality x = e is interpreted as an assignment of e to the yet unbound variable x. Inspired by TLC, we introduce an automatic technique for discovering expressions in TLA+ formulas such as x = e and x ∈ {e1,. .. , e k } that can be provably used as assignments. In contrast to TLC, our technique does not explicitly evaluate expressions, but it reduces the problem of finding assignments to the satisfiability of an SMT formula. Hence, we give a way to slice a TLA+ formula in symbolic transitions, which can be used as an input to a symbolic model checker. Our prototype implementation successfully extracts symbolic transitions from a few TLA+ benchmarks

Quaternary glacial history of the Mediterranean mountains

Glacial and periglacial landforms are widespread in the mountains of the Mediterranean region. The evidence for glacial and periglacial activity has been studied for over 120 years and it is possible to identify three phases of development in this area of research. First, a pioneer phase characterized by initial descriptive observations of glacial landforms; second, a mapping phase whereby the detailed distribution of glacial landforms and sediments have been depicted on geomorphological maps; and, third, an advanced phase characterized by detailed understanding of the geochronology of glacial sequences using radiometric dating alongside detailed sedimentological and stratigraphical analyses. It is only relatively recently that studies of glaciated mountain terrains in the Mediterranean region have reached an advanced phase and it is now clear from radiometric dating programmes that the Mediterranean mountains have been glaciated during multiple glacial cycles. The most extensive phases of glaciation appear to have occurred during the Middle Pleistocene. This represents a major shift from earlier work whereby many glacial sequences were assumed to have formed during the last cold stage. Glacial and periglacial deposits from multiple Quaternary cold stages constitute a valuable palaeoclimatic record. This is especially so in the Mediterranean mountains, since mountain glaciers in this latitudinal zone would have been particularly sensitive to changes in the global climate system. © 2006 Edward Arnold (Publishers) Ltd

A methodology for detecting the orthology signal in a PPI network at a functional complex level

Contains fulltext : 93730.pdf (preprint version ) (Open Access)13 p

G2 checkpoint abrogation and checkpoint kinase-1 targeting in the treatment of cancer

Rigorous quality control steps, termed checkpoints, tightly regulate progression through the cell cycle. DNA-damaging chemotherapy and radiation activate functional cellular checkpoints. These checkpoints can facilitate DNA repair and promote cell death in unrepaired cells. There are at least three DNA damage checkpoints – at G1/S, S, and G2/M – as well as a mitotic spindle checkpoint. Most cancer cells harbour mutations in tumour suppressors and/or oncogenes, which impair certain cell checkpoints. Inhibiting the remaining cell checkpoints – particularly after exposure of cancer cells to chemotherapy and/or radiation – allows cell death, a strategy now being employed in cancer therapeutics. With our increasing knowledge of cell cycle regulation, many compounds have been developed to inhibit specific checkpoint components, particularly at the G2/M transition. One such target is checkpoint kinase-1 (Chk1). We review here the molecular framework of the cell cycle, the rationale for targeting Chk1, the preclinical concepts related to the development of Chk1 inhibitors, and the efficacy and safety results from Chk1 inhibitors now in phase I/II trials