Controlled and effective interpolation

Model checking is a well established technique to verify systems, exhaustively and automatically. The state space explosion, known as the main difficulty in model checking scalability, has been successfully approached by symbolic model checking which represents programs using logic, usually at the propositional or first order theories level. Craig interpolation is one of the most successful abstraction techniques used in symbolic methods. Interpolants can be efficiently generated from proofs of unsatisfiability, and have been used as means of over-approximation to generate inductive invariants, refinement predicates, and function summaries. However, interpolation is still not fully understood. For several theories it is only possible to generate one interpolant, giving the interpolation-based application no chance of further optimization via interpolation. For the theories that have interpolation systems that are able to generate different interpolants, it is not understood what makes one interpolant better than another, and how to generate the most suitable ones for a particular verification task. The goal of this thesis is to address the problems of how to generate multiple interpolants for theories that still lack this flexibility in their interpolation algorithms, and how to aim at good interpolants. This thesis extends the state-of-the-art by introducing novel interpolation frameworks for different theories. For propositional logic, this work provides a thorough theoretical analysis showing which properties are desirable in a labeling function for the Labeled Interpolation Systems framework (LIS). The Proof-Sensitive labeling function is presented, and we prove that it generates interpolants with the smallest number of Boolean connectives in the entire LIS framework. Two variants that aim at controlling the logical strength of propositional interpolants while maintaining a small size are given. The new interpolation algorithms are compared to previous ones from the literature in different model checking settings, showing that they consistently lead to a better overall verification performance. The Equalities and Uninterpreted Functions (EUF)-interpolation system, presented in this thesis, is a duality-based interpolation framework capable of generating multiple interpolants for a single proof of unsatisfiability, and provides control over the logical strength of the interpolants it generates using labeling functions. The labeling functions can be theoretically compared with respect to their strength, and we prove that two of them generate the interpolants with the smallest number of equalities. Our experiments follow the theory, showing that the generated interpolants indeed have different logical strength. We combine propositional and EUF interpolation in a model checking setting, and show that the strength of the interpolation algorithms for different theories has to be aligned in order to generate smaller interpolants. This work also introduces the Linear Real Arithmetic (LRA)-interpolation system, an interpolation framework for LRA. The framework is able to generate infinitely many interpolants of different logical strength using the duality of interpolants. The strength of the LRA interpolants can be controlled by a normalized strength factor, which makes it straightforward for an interpolationbased application to choose the level of strength it wants for the interpolants. Our experiments with the LRA-interpolation system and a model checker show that it is very important for the application to be able to fine tune the strength of the LRA interpolants in order to achieve optimal performance. The interpolation frameworks were implemented and form the interpolation module in OpenSMT2, an open source efficient SMT solver. OpenSMT2 has been integrated to the propositional interpolation-based model checkers FunFrog and eVolCheck, and to the first order interpolation-based model checkerHiFrog. This thesis presents real life model checking experiments using the novel interpolation frameworks and the tools aforementioned, showing the viability and strengths of the techniques

Propriedades decidíveis de autômatos celulares finitos, híbridos, não-lineares, sensíveis e reversíveis

We investigated the decidability and complexity of the Predecessor and the Configuration Reachability problems in Non-Linear, Sensitive, Reversible, Hybridand Finite Cellular Automata. We demonstrated the model’s reversibility (defined here as HSR, Híbrido Sensível Reversível, or Hybrid Reversible Toggle), which, in turn solves the Predecessor’s Problem. Using Disjunctive Normal Form to represent transition functions, by Boolean partial derivatives, we could transform them to the Algebraic Normal Form. We show that using matrix form and Boolean partial derivatives sit is possible to calculate several HSR evolution steps in polynomial time; so we demonstrated that the Configuration Reachability Problem belongs to the complexity class “Arthur-Merlin” AM2 and cannot be NP-Complete (unless the hierarchy collapses). We also proposed a new cryptographic method based on the model HSR, whose cryptographic keys are combinations of elementary transition functions, what increases the method’s eficiency, without compromising security, since even small lattice sizes make the key space cardinality very large.Coordenação de Aperfeiçoamento de Pessoal de Nível SuperiorDissertação (Mestrado)Nós investigamos a decidibilidade e complexidade dos problemas do Predecessor e da Alcançabilidade em Autômatos Celulares Finitos, Híbridos, Reversíveis, Sensíveis e Não- Lineares. Demonstramos a reversibilidade do modelo, aqui definido como HSR, resolvendo assim o Problema do Predecessor. Utilizando a Forma Normal Disjuntiva para representar as funções de transição, conseguimos por derivadas parciais booleanas transformá-las para a Forma Normal Algébrica. Mostramos que utilizando a forma matricial e também as derivadas parciais booleanas é possível calcular vários passos da evolução temporal do modelo HSR em tempo polinomial; com isso demonstramos que o Problema da Alcançabilidade pertence à classe “Arthur-Merlin” AM2 e por isso não pode ser NP-Completo (a não ser que a hierarquia colapse). Também propusemos um novo método criptográfico baseado no modelo de AC HSR, cujas chaves criptográficas são combinações de funções de transição elementares, o que aumenta a eficiência do método sem abrir mão da segurança, já que mesmo tamanhos pequenos de reticulado fazem a cardinalidade do espaço de chaves ser muito grande

A reversible system based on hybrid toggle radius-4 cellular automata and its application as a block cipher

The dynamical system described herein uses a hybrid cellular automata (CA) mechanism to attain reversibility, and this approach is adapted to create a novel block cipher algorithm called HCA. CA are widely used for modeling complex systems and employ an inherently parallel model. Therefore, applications derived from CA have a tendency to fit very well in the current computational paradigm where scalability and multi-threading potential are quite desirable characteristics. HCA model has recently received a patent by the Brazilian agency INPI. Several evaluations and analyses performed on the model are presented here, such as theoretical discussions related to its reversibility and an analysis based on graph theory, which reduces HCA security to the well-known Hamiltonian cycle problem that belongs to the NP-complete class. Finally, the cryptographic robustness of HCA is empirically evaluated through several tests, including avalanche property compliance and the NIST randomness suite.Comment: 34 pages, 12 figure

Short Paper: Blockcheck the Typechain

Recent efforts have sought to design new smart contract programming languages that make writing blockchain programs safer. But programs on the blockchain are beholden only to the safety properties enforced by the blockchain itself: even the strictest language-only properties can be rendered moot on a language-oblivious blockchain due to inter-contract interactions. Consequently, while safer languages are a necessity, fully realizing their benefits necessitates a language-aware redesign of the blockchain itself. To this end, we propose that the blockchain be viewed as a typechain: a chain of typed programs-not arbitrary blocks-that are included iff they typecheck against the existing chain. Reaching consensus, or blockchecking, validates typechecking in a byzantine fault-tolerant manner. Safety properties traditionally enforced by a runtime are instead enforced by a type system with the aim of statically capturing smart contract correctness. To provide a robust level of safety, we contend that a typechain must minimally guarantee (1) asset linearity and liveness, (2) physical resource availability, including CPU and memory, (3) exceptionless execution, or no early termination, (4) protocol conformance, or adherence to some state machine, and (5) inter-contract safety, including reentrancy safety. Despite their exacting nature, typechains are extensible, allowing for rich libraries that extend the set of verified properties. We expand on typechain properties and present examples of real-world bugs they prevent

Genomic transformation and social organization during the Copper Age-Bronze Age transition in southern Iberia

The emerging Bronze Age (BA) of southeastern Iberia saw marked social changes. Late Copper Age (CA) settlements were abandoned in favor of hilltop sites, and collective graves were largely replaced by single or double burials with often distinctive grave goods indirectly reflecting a hierarchical social organization, as exemplified by the BA El Argar group. We explored this transition from a genomic viewpoint by tripling the amount of data available for this period. Concomitant with the rise of El Argar starting ∼2200 cal BCE, we observe a complete turnover of Y-chromosome lineages along with the arrival of steppe-related ancestry. This pattern is consistent with a founder effect in male lineages, supported by our finding that males shared more relatives at sites than females. However, simple two-source models do not find support in some El Argar groups, suggesting additional genetic contributions from the Mediterranean that could predate the BA.This work was supported by the Max Planck Society (V.V.-M. and W.H.); European Research Council (ERC) grant 771234—PALEoRIDER (W.H.); Spanish Ministry of Economy, Industry and Competitiveness project HAR2017-85962-P (C.O., C.R.-H., M.I.F., E.C.B., C.V.-F., V.L., R.M., and R.R.); AGAUR 2017SGR1044 (C.O., C.R.-H., M.I.F., E.C.B., C.V.-F., V.L., R.M., and R.R.); ICREA Academia program (R.R.); John Templeton Foundation grant 61220 (D.R.); and Paul Allen Family Foundation (D.R.). D.R. is an Investigator of the Howard Hughes Medical Institute

Genomic transformation and social organization during the Copper Age-Bronze Age transition in southern Iberia

[EN]The emerging Bronze Age (BA) of southeastern Iberia saw marked social changes. Late Copper Age (CA) settlements were abandoned in favor of hilltop sites, and collective graves were largely replaced by single or double burials with often distinctive grave goods indirectly reflecting a hierarchical social organization, as exemplified by the BA El Argar group. We explored this transition from a genomic viewpoint by tripling the amount of data available for this period. Concomitant with the rise of El Argar starting similar to 2200 cal BCE, we observe a complete turnover of Y-chromosome lineages along with the arrival of steppe-related ancestry. This pattern is consistent with a founder effect in male lineages, supported by our finding that males shared more relatives at sites than females. However, simple two-source models do not find support in some El Argar groups, suggesting additional genetic contributions from the Mediterranean that could predate the BA.This work was supported by the Max Planck Society (V.V.-M. and W.H.); European Research Council (ERC) grant 771234-PALEoRIDER (W. H.); Spanish Ministry of Economy, Industry and Competitiveness project HAR2017-85962-P (C.O., C.R.-H., M.I.F., E.C.B., C.V.-F., V.L., R.M., and R.R.); AGAUR 2017SGR1044 (C.O., C.R.-H., M.I.F., E. C.B., C.V.-F., V. L., R.M., and R.R.); ICREA Academia program (R.R.); John Templeton Foundation grant 61220 (D.R.); and Paul Allen Family Foundation (D.R.). D.R. is an Investigator of the Howard Hughes Medical Institute

A Novel, Non-Apoptotic Role for Scythe/BAT3: A Functional Switch between the Pro- and Anti-Proliferative Roles of p21 during the Cell Cycle

BACKGROUND: Scythe/BAT3 is a member of the BAG protein family whose role in apoptosis has been extensively studied. However, since the developmental defects observed in Bat3-null mouse embryos cannot be explained solely by defects in apoptosis, we investigated whether BAT3 is also involved in cell-cycle progression. METHODS/PRINCIPAL FINDINGS: Using a stable-inducible Bat3-knockdown cellular system, we demonstrated that reduced BAT3 protein level causes a delay in both G1/S transition and G2/M progression. Concurrent with these changes in cell-cycle progression, we observed a reduction in the turnover and phosphorylation of the CDK inhibitor p21, which is best known as an inhibitor of DNA replication; however, phosphorylated p21 has also been shown to promote G2/M progression. Our findings indicate that in Bat3-knockdown cells, p21 continues to be synthesized during cell-cycle phases that do not normally require p21, resulting in p21 protein accumulation and a subsequent delay in cell-cycle progression. Finally, we showed that BAT3 co-localizes with p21 during the cell cycle and is required for the translocation of p21 from the cytoplasm to the nucleus during the G1/S transition and G2/M progression. CONCLUSION: Our study reveals a novel, non-apoptotic role for BAT3 in cell-cycle regulation. By maintaining a low p21 protein level during the G1/S transition, BAT3 counteracts the inhibitory effect of p21 on DNA replication and thus enables the cells to progress from G1 to S phase. Conversely, during G2/M progression, BAT3 facilitates p21 phosphorylation by cyclin A/Cdk2, an event required for G2/M progression. BAT3 modulates these pro- and anti-proliferative roles of p21 at least in part by regulating cyclin A abundance, as well as p21 translocation between the cytoplasm and the nucleus to ensure that it functions in the appropriate intracellular compartment during each phase of the cell cycle.Dissertatio

The SHiP experiment at the proposed CERN SPS Beam Dump Facility

The Search for Hidden Particles (SHiP) Collaboration has proposed a general-purpose experimental facility operating in beam-dump mode at the CERN SPS accelerator to search for light, feebly interacting particles. In the baseline configuration, the SHiP experiment incorporates two complementary detectors. The upstream detector is designed for recoil signatures of light dark matter (LDM) scattering and for neutrino physics, in particular with tau neutrinos. It consists of a spectrometer magnet housing a layered detector system with high-density LDM/neutrino target plates, emulsion-film technology and electronic high-precision tracking. The total detector target mass amounts to about eight tonnes. The downstream detector system aims at measuring visible decays of feebly interacting particles to both fully reconstructed final states and to partially reconstructed final states with neutrinos, in a nearly background-free environment. The detector consists of a 50 m long decay volume under vacuum followed by a spectrometer and particle identification system with a rectangular acceptance of 5 m in width and 10 m in height. Using the high-intensity beam of 400 GeV protons, the experiment aims at profiting from the 4 x 10(19) protons per year that are currently unexploited at the SPS, over a period of 5-10 years. This allows probing dark photons, dark scalars and pseudo-scalars, and heavy neutral leptons with GeV-scale masses in the direct searches at sensitivities that largely exceed those of existing and projected experiments. The sensitivity to light dark matter through scattering reaches well below the dark matter relic density limits in the range from a few MeV/c(2) up to 100 MeV-scale masses, and it will be possible to study tau neutrino interactions with unprecedented statistics. This paper describes the SHiP experiment baseline setup and the detector systems, together with performance results from prototypes in test beams, as it was prepared for the 2020 Update of the European Strategy for Particle Physics. The expected detector performance from simulation is summarised at the end

Azimuthal anisotropy of charged jet production in root s(NN)=2.76 TeV Pb-Pb collisions

We present measurements of the azimuthal dependence of charged jet production in central and semi-central root s(NN) = 2.76 TeV Pb-Pb collisions with respect to the second harmonic event plane, quantified as nu(ch)(2) (jet). Jet finding is performed employing the anti-k(T) algorithm with a resolution parameter R = 0.2 using charged tracks from the ALICE tracking system. The contribution of the azimuthal anisotropy of the underlying event is taken into account event-by-event. The remaining (statistical) region-to-region fluctuations are removed on an ensemble basis by unfolding the jet spectra for different event plane orientations independently. Significant non-zero nu(ch)(2) (jet) is observed in semi-central collisions (30-50% centrality) for 20 <p(T)(ch) (jet) <90 GeV/c. The azimuthal dependence of the charged jet production is similar to the dependence observed for jets comprising both charged and neutral fragments, and compatible with measurements of the nu(2) of single charged particles at high p(T). Good agreement between the data and predictions from JEWEL, an event generator simulating parton shower evolution in the presence of a dense QCD medium, is found in semi-central collisions. (C) 2015 CERN for the benefit of the ALICE Collaboration. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).Peer reviewe