SMT-based model checkers, especially IC3-style ones, are currently the most effective techniques for verification of infinite state systems. They infer global inductive invariants via local reasoning about a single step of the transition relation of a system, while employing SMTbased procedures, such as interpolation, to mitigate the limitations of local reasoning and allow for better generalization. Unfortunately, these mitigations intertwine model checking with heuristics of the underlying SMT-solver, negatively affecting stability of model checking. In this paper, we propose to tackle the limitations of locality in a systematic manner. We introduce explicit global guidance into the local reasoning performed by IC3-style algorithms. To this end, we extend the SMT-IC3 paradigm with three novel rules, designed to mitigate fundamental sources of failure that stem from locality. We instantiate these rules for the theory of Linear Integer Arithmetic and implement them on top of Spacer solver in Z3. Our empirical results show that GSpacer, Spacer extended with global guidance, is significantly more effective than both Spacer and sole global reasoning, and, furthermore, is insensitive to interpolation.

Fragile X syndrome (FXS) is the most frequent cause of inherited mental retardation and is largely caused by a loss of expression of fragile X mental retardation protein (FMRP), encoded by fragile X retardation gene-1 (Fmr1). FMRP is a multifunction protein, with intrinsic RNA-binding properties, which is a component of ribonucleoprotein complex associated with polyribosomes. The properties of FMRP indicate that it might participate in post-transcriptional processes in the regulation of some mRNA species, including localization, stability and translational control. However, the function of FMRP related to the pathologenesis in FXS is largely unknown. Many efforts were undertaken to identify the putative specific RNA targets as well as the FMRP-related proteins and to identify the effect of FMRP absence on the corresponding proteins. Here we present our efforts using proteomics approach to explore the differential expression profiling of mouse cerebella immortal cell, in which we changed the expression of FMRP by expressing Fmr1 gene with nuclear export signal (NES) mutation. This mutation makes FMRP unable to shuttle from nucleus to cytoplasm and leads to nuclear instead of cytoplasmic location as usual, which was hypothesized to affect the pathways of groups of RNAs or proteins related with FMRP. In present study, 56 proteins were found to be differentially expressed in transfected R2 neuronal cells, including 16 decreased expressions and 40 increased expressions. The differentially expressed proteins play roles in diverse physiological processes, such as neuronal plasticity, spermatogenesis and craniofacial and limb development etc. In addition, the expressions of three mRNA identified as FMRP targets in fragile X cell were tested in present model cells. All these results provide new insights to the role of FMRP in the disease.

Program verifiers are not exempt from the bugs that affect nearly every piece of software. In addition, they often exhibit brittle behavior: their performance changes considerably with details of how the input program is expresseddetails that should be irrelevant, such as the order of independent declarations. Such a lack of robustness frustrates users who have to spend considerable time figuring out a tool's idiosyncrasies before they can use it effectively. This paper introduces a technique to detect lack of robustness of program verifiers; the technique is lightweight and fully automated, as it is based on testing methods (such as mutation testing and metamorphic testing). The key idea is to generate many simple variants of a program that initially passes verification. All variants are, by construction, equivalent to the original program; thus, any variant that fails verification indicates lack of robustness in the verifier. We implemented our technique in a tool called µgie, which operates on programs written in the popular Boogie language for verification-used as intermediate representation in numerous program verifiers. Experiments targeting 135 Boogie programs indicate that brittle behavior occurs fairly frequently (16 programs) and is not hard to trigger. Based on these results, the paper discusses the main sources of brittle behavior and suggests means of improving robustness.

No abstract

SMT-based model checkers, especially IC3-style ones, are currently the most effective techniques for verification of infinite state systems. They infer global inductive invariants via local reasoning about a single step of the transition relation of a system, while employing SMT-based procedures, such as interpolation, to mitigate the limitations of local reasoning and allow for better generalization. Unfortunately, these mitigations intertwine model checking with heuristics of the underlying SMT-solver, negatively affecting stability of model checking. In this paper, we propose to tackle the limitations of locality in a systematic manner. We introduce explicit global guidance into the local reasoning performed by IC3-style algorithms. To this end, we extend the SMT-IC3 paradigm with three novel rules, designed to mitigate fundamental sources of failure that stem from locality. We instantiate these rules for Linear Integer Arithmetic and Linear Rational Aritmetic and implement them on top of Spacer solver in Z3. Our empirical results show that GSpacer, Spacer extended with global guidance, is significantly more effective than both Spacer and sole global reasoning, and, furthermore, is insensitive to interpolation.