Generating Non-Linear Interpolants by Semidefinite Programming

Interpolation-based techniques have been widely and successfully applied in the verification of hardware and software, e.g., in bounded-model check- ing, CEGAR, SMT, etc., whose hardest part is how to synthesize interpolants. Various work for discovering interpolants for propositional logic, quantifier-free fragments of first-order theories and their combinations have been proposed. However, little work focuses on discovering polynomial interpolants in the literature. In this paper, we provide an approach for constructing non-linear interpolants based on semidefinite programming, and show how to apply such results to the verification of programs by examples.Comment: 22 pages, 4 figure

Assisted coverage closure

Malfunction of safety-critical systems may cause damage to people and the environment. Software within those systems is rigorously designed and verified according to domain specific guidance, such as ISO26262 for automotive safety. This paper describes academic and industrial co-operation in tool development to support one of the most stringent of the requirements --- achieving full code coverage in requirements-driven testing. We present a verification workflow supported by a tool that integrates the coverage measurement tool RapiCover with the test-vector generator FShell. The tool assists closing the coverage gap by providing the engineer with test vectors that help in debugging coverage-related code quality issues and creating new test cases, as well as justifying the presence of unreachable parts of the code in order to finally achieve full effective coverage according to the required criteria. We illustrate the tool's practical utility on automotive industry benchmarks. It generates 8 times more MC/DC coverage than random search

Cells' Flow and Immune Cell Priming under alternating g-forces in Parabolic Flight

Gravitational stress in general and microgravity (mu g) in particular are regarded as major stress factors responsible for immune system dysfunction in space. To assess the effects of alternating mu g and hypergravity (hyper-g) on immune cells, the attachment of peripheral blood mononuclear cells (PBMCs) to adhesion molecules under flow conditions and the antigen-induced immune activation in whole blood were investigated in parabolic flight (PF). In contrast to hyper-g (1.8 g) and control conditions (1 g), flow and rolling speed of PBMCs were moderately accelerated during mu g-periods which were accompanied by a clear reduction in rolling rate. Whole blood analyses revealed a "primed" state of monocytes after PF with potentiated antigen-induced pro-inflammatory cytokine responses. At the same time, concentrations of anti-inflammatory cytokines were increased and monocytes displayed a surface molecule pattern that indicated immunosuppression. The results suggest an immunologic counterbalance to avoid disproportionate immune responses. Understanding the interrelation of immune system impairing and enhancing effects under different gravitational conditions may support the design of countermeasures to mitigate immune deficiencies in space

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

Synthesizing and tuning chemical reaction networks with specified behaviours

We consider how to generate chemical reaction networks (CRNs) from functional specifications. We propose a two-stage approach that combines synthesis by satisfiability modulo theories and Markov chain Monte Carlo based optimisation. First, we identify candidate CRNs that have the possibility to produce correct computations for a given finite set of inputs. We then optimise the reaction rates of each CRN using a combination of stochastic search techniques applied to the chemical master equation, simultaneously improving the of correct behaviour and ruling out spurious solutions. In addition, we use techniques from continuous time Markov chain theory to study the expected termination time for each CRN. We illustrate our approach by identifying CRNs for majority decision-making and division computation, which includes the identification of both known and unknown networks.Comment: 17 pages, 6 figures, appeared the proceedings of the 21st conference on DNA Computing and Molecular Programming, 201

Efficient Certified Resolution Proof Checking

We present a novel propositional proof tracing format that eliminates complex processing, thus enabling efficient (formal) proof checking. The benefits of this format are demonstrated by implementing a proof checker in C, which outperforms a state-of-the-art checker by two orders of magnitude. We then formalize the theory underlying propositional proof checking in Coq, and extract a correct-by-construction proof checker for our format from the formalization. An empirical evaluation using 280 unsatisfiable instances from the 2015 and 2016 SAT competitions shows that this certified checker usually performs comparably to a state-of-the-art non-certified proof checker. Using this format, we formally verify the recent 200 TB proof of the Boolean Pythagorean Triples conjecture

Component-wise incremental LTL model checking

Efficient symbolic and explicit-state model checking approaches have been developed for the verification of linear time temporal logic (LTL) properties. Several attempts have been made to combine the advantages of the various algorithms. Model checking LTL properties usually poses two challenges: one must compute the synchronous product of the state space and the automaton model of the desired property, then look for counterexamples that is reduced to finding strongly connected components (SCCs) in the state space of the product. In case of concurrent systems, where the phenomenon of state space explosion often prevents the successful verification, the so-called saturation algorithm has proved its efficiency in state space exploration. This paper proposes a new approach that leverages the saturation algorithm both as an iteration strategy constructing the product directly, as well as in a new fixed-point computation algorithm to find strongly connected components on-the-fly by incrementally processing the components of the model. Complementing the search for SCCs, explicit techniques and component-wise abstractions are used to prove the absence of counterexamples. The resulting on-the-fly, incremental LTL model checking algorithm proved to scale well with the size of models, as the evaluation on models of the Model Checking Contest suggests

Flower vs. Leaf Feeding by Pieris brassicae: Glucosinolate-Rich Flower Tissues are Preferred and Sustain Higher Growth Rate

Interactions between butterflies and caterpillars in the genus Pieris and plants in the family Brassicaceae are among the best explored in the field of insect–plant biology. However, we report here for the first time that Pieris brassicae, commonly assumed to be a typical folivore, actually prefers to feed on flowers of three Brassica nigra genotypes rather than on their leaves. First- and second-instar caterpillars were observed to feed primarily on leaves, whereas late second and early third instars migrated via the small leaves of the flower branches to the flower buds and flowers. Once flower feeding began, no further leaf feeding was observed. We investigated growth rates of caterpillars having access exclusively to either leaves of flowering plants or flowers. In addition, we analyzed glucosinolate concentrations in leaves and flowers. Late-second- and early-third-instar P. brassicae caterpillars moved upward into the inflorescences of B. nigra and fed on buds and flowers until the end of the final (fifth) instar, after which they entered into the wandering stage, leaving the plant in search of a pupation site. Flower feeding sustained a significantly higher growth rate than leaf feeding. Flowers contained levels of glucosinolates up to five times higher than those of leaves. Five glucosinolates were identified: the aliphatic sinigrin, the aromatic phenyethylglucosinolate, and three indole glucosinolates: glucobrassicin, 4-methoxyglucobrassicin, and 4-hydroxyglucobrassicin. Tissue type and genotype were the most important factors affecting levels of identified glucosinolates. Sinigrin was by far the most abundant compound in all three genotypes. Sinigrin, 4-hydroxyglucobrassicin, and phenylethylglucosinolate were present at significantly higher levels in flowers than in leaves. In response to caterpillar feeding, sinigrin levels in both leaves and flowers were significantly higher than in undamaged plants, whereas 4-hydroxyglucobrassicin leaf levels were lower. Our results show that feeding on flower tissues, containing higher concentrations of glucosinolates, provides P. brassicae with a nutritional benefit in terms of higher growth rate. This preference appears to be in contrast to published negative effects of volatile glucosinolate breakdown products on the closely related Pieris rapae