Weakly Z symmetric manifolds

We introduce a new kind of Riemannian manifold that includes weakly-, pseudo- and pseudo projective- Ricci symmetric manifolds. The manifold is defined through a generalization of the so called Z tensor; it is named "weakly Z symmetric" and denoted by (WZS)_n. If the Z tensor is singular we give conditions for the existence of a proper concircular vector. For non singular Z tensor, we study the closedness property of the associated covectors and give sufficient conditions for the existence of a proper concircular vector in the conformally harmonic case, and the general form of the Ricci tensor. For conformally flat (WZS)_n manifolds, we derive the local form of the metric tensor.Comment: 13 page

SMT-based Model Checking for Recursive Programs

We present an SMT-based symbolic model checking algorithm for safety verification of recursive programs. The algorithm is modular and analyzes procedures individually. Unlike other SMT-based approaches, it maintains both "over-" and "under-approximations" of procedure summaries. Under-approximations are used to analyze procedure calls without inlining. Over-approximations are used to block infeasible counterexamples and detect convergence to a proof. We show that for programs and properties over a decidable theory, the algorithm is guaranteed to find a counterexample, if one exists. However, efficiency depends on an oracle for quantifier elimination (QE). For Boolean Programs, the algorithm is a polynomial decision procedure, matching the worst-case bounds of the best BDD-based algorithms. For Linear Arithmetic (integers and rationals), we give an efficient instantiation of the algorithm by applying QE "lazily". We use existing interpolation techniques to over-approximate QE and introduce "Model Based Projection" to under-approximate QE. Empirical evaluation on SV-COMP benchmarks shows that our algorithm improves significantly on the state-of-the-art.Comment: originally published as part of the proceedings of CAV 2014; fixed typos, better wording at some place

Static Safety for an Actor Dedicated Process Calculus by Abstract Interpretation

The actor model eases the definition of concurrent programs with non uniform behaviors. Static analysis of such a model was previously done in a data-flow oriented way, with type systems. This approach was based on constraint set resolution and was not able to deal with precise properties for communications of behaviors. We present here a new approach, control-flow oriented, based on the abstract interpretation framework, able to deal with communication of behaviors. Within our new analyses, we are able to verify most of the previous properties we observed as well as new ones, principally based on occurrence counting

Testing real-time systems using TINA

The paper presents a technique for model-based black-box conformance testing of real-time systems using the Time Petri Net Analyzer TINA. Such test suites are derived from a prioritized time Petri net composed of two concurrent sub-nets specifying respectively the expected behaviour of the system under test and its environment.We describe how the toolbox TINA has been extended to support automatic generation of time-optimal test suites. The result is optimal in the sense that the set of test cases in the test suite have the shortest possible accumulated time to be executed. Input/output conformance serves as the notion of implementation correctness, essentially timed trace inclusion taking environment assumptions into account. Test cases selection is based either on using manually formulated test purposes or automatically from various coverage criteria specifying structural criteria of the model to be fulfilled by the test suite. We discuss how test purposes and coverage criterion are specified in the linear temporal logic SE-LTL, derive test sequences, and assign verdicts

Software Model Checking with Explicit Scheduler and Symbolic Threads

In many practical application domains, the software is organized into a set of threads, whose activation is exclusive and controlled by a cooperative scheduling policy: threads execute, without any interruption, until they either terminate or yield the control explicitly to the scheduler. The formal verification of such software poses significant challenges. On the one side, each thread may have infinite state space, and might call for abstraction. On the other side, the scheduling policy is often important for correctness, and an approach based on abstracting the scheduler may result in loss of precision and false positives. Unfortunately, the translation of the problem into a purely sequential software model checking problem turns out to be highly inefficient for the available technologies. We propose a software model checking technique that exploits the intrinsic structure of these programs. Each thread is translated into a separate sequential program and explored symbolically with lazy abstraction, while the overall verification is orchestrated by the direct execution of the scheduler. The approach is optimized by filtering the exploration of the scheduler with the integration of partial-order reduction. The technique, called ESST (Explicit Scheduler, Symbolic Threads) has been implemented and experimentally evaluated on a significant set of benchmarks. The results demonstrate that ESST technique is way more effective than software model checking applied to the sequentialized programs, and that partial-order reduction can lead to further performance improvements.Comment: 40 pages, 10 figures, accepted for publication in journal of logical methods in computer scienc

Subsumer-First: Steering Symbolic Reachability Analysis

Abstract. Symbolic reachability analysis provides a basis for the veri-fication of software systems by offering algorithmic support for the ex-ploration of the program state space when searching for proofs or coun-terexamples. The choice of exploration strategy employed by the anal-ysis has direct impact on its success, whereas the ability to find short counterexamples quickly and—as a complementary task—to efficiently perform the exhaustive state space traversal are of utmost importance for the majority of verification efforts. Existing exploration strategies can optimize only one of these objectives which leads to a sub-optimal reach-ability analysis, e.g., breadth-first search may sacrifice the exploration ef-ficiency and chaotic iteration can miss minimal counterexamples. In this paper we present subsumer-first, a new approach for steering symbolic reachability analysis that targets both minimal counterexample discovery and efficiency of exhaustive exploration. Our approach leverages the re-sult of fixpoint checks performed during symbolic reachability analysis to bias the exploration strategy towards its objectives, and does not require any additional computation. We demonstrate how the subsumer-first ap-proach can be applied to improve efficiency of software verification tools based on predicate abstraction. Our experimental evaluation indicates the practical usefulness of the approach: we observe significant efficiency improvements (median value 40%) on difficult verification benchmarks from the transportation domain.

Opto-electrical characterisation of In-doped SnS thin films for photovoltaic applications

[EN] Spray pyrolised SnS thin films doped with indium were studied using various optical and electrical techniques.Structural analysis shows that all films crystallise in an orthorhombic structurewith (111) as a preferential direction, without secondary phases. The doping of SnS layers with indium results in better morphology with increased grain size. Absorption measurements indicate a dominant direct transition with energy decreasing from around 1.7 eV to 1.5 eV with increased indium supply. Apart from the direct transition, an indirect one, of energy of around 1.05 eV, independent of indiumdoping, was identified. The photoluminescence study revealed two donors to acceptor transitions between two deep defect levels and one shallower one, with an energy of around 90 meV. The observed transitions did not depend significantly on In concentration. The conductivitymeasurements reveal thermal activation of conductivity with energy decreasing from around 165 meV to 145 meV with increased In content.This work was supported by the Ministerio de Economia y Competitividad (ENE2016-77798-C4-2-R) and Generalitat Valenciana (Prometeus 2014/044).Urbaniak, A.; Pawlowski, M.; Marzantowicz, M.; Sall, T.; Marí, B. (2017). Opto-electrical characterisation of In-doped SnS thin films for photovoltaic applications. Thin Solid Films. 636:158-163. https://doi.org/10.1016/j.tsf.2017.06.001S15816363

An affordable, quality-assured community-based system for high-resolution entomological surveillance of vector mosquitoes that reflects human malaria infection risk patterns.

ABSTRACT: BACKGROUND: More sensitive and scalable entomological surveillance tools are required to monitor low levels of transmission that are increasingly common across the tropics, particularly where vector control has been successful. A large-scale larviciding programme in urban Dar es Salaam, Tanzania is supported by a community-based (CB) system for trapping adult mosquito densities to monitor programme performance. Methodology An intensive and extensive CB system for routine, longitudinal, programmatic surveillance of malaria vectors and other mosquitoes using the Ifakara Tent Trap (ITT-C) was developed in Urban Dar es Salaam, Tanzania, and validated by comparison with quality assurance (QA) surveys using either ITT-C or human landing catches (HLC), as well as a cross-sectional survey of malaria parasite prevalence in the same housing compounds. RESULTS: Community-based ITT-C had much lower sensitivity per person-night of sampling than HLC (Relative Rate (RR) [95% Confidence Interval (CI)] = 0.079 [0.051, 0.121], P < 0.001 for Anopheles gambiae s.l. and 0.153 [0.137, 0.171], P < 0.001 for Culicines) but only moderately differed from QA surveys with the same trap (0.536 [0.406,0.617], P = 0.001 and 0.747 [0.677,0.824], P < 0.001, for An. gambiae or Culex respectively). Despite the poor sensitivity of the ITT per night of sampling, when CB-ITT was compared with QA-HLC, it proved at least comparably sensitive in absolute terms (171 versus 169 primary vectors caught) and cost-effective (153US$versus 187US$ per An. gambiae caught) because it allowed more spatially extensive and temporally intensive sampling (4284 versus 335 trap nights distributed over 615 versus 240 locations with a mean number of samples per year of 143 versus 141). Despite the very low vectors densities (Annual estimate of about 170 An gambiae s.l bites per person per year), CB-ITT was the only entomological predictor of parasite infection risk (Odds Ratio [95% CI] = 4.43[3.027,7. 454] per An. gambiae or Anopheles funestus caught per night, P =0.0373). Discussion and conclusion CB trapping approaches could be improved with more sensitive traps, but already offer a practical, safe and affordable system for routine programmatic mosquito surveillance and clusters could be distributed across entire countries by adapting the sample submission and quality assurance procedures accordingly

Shuffle–based verification of component compatibility

An extension of earlier work on component compatibility is described in this paper. Similarly as before, the behavior of components is specified by component interface languages, and the shuffle operation is introduced to represent possible interleavings of service requests that originate at several concurrent components. The paper shows that the verification of component compatibility is possible without the exhaustive analysis of the state space of interacting components. Exhaustive analysis of state spaces was the basis of earlier approaches to compatibility verification

A Language-Independent Proof System for Mutual Program Equivalence

International audienceTwo programs are mutually equivalent if they both diverge or they end up in similar states. Mutual equivalence is an adequate notion of equivalence for programs written in deterministic languages. It is useful in many contexts, such as capturing the correctness of, program transformations within the same language, or capturing the correctness of compilers between two different languages. In this paper we introduce a language-independent proof system for mutual equivalence, which is parametric in the operational semantics of two languages and in a state-similarity relation. The proof system is sound: if it terminates then it establishes the mutual equivalence of the programs given to it as input. We illustrate it on two programs in two different languages (an imperative one and a functional one), that both compute the Collatz sequence.Deux programmes sont en équivalence mutuelle s'ils divergent tous les deux ou s'ils terminent dans des états similaires. L'équivalence mutuelle est une notion adéquate d'équivalence pour les programmes déterministes. Elle est utile dans divers contextes, parmi lesquels on peut citer la preuve de transformations de programmes dans un langage donné, et la preuve de compilateurs entre deux langages. Dans cet article nous introduisons un système déductif pour l'équivalence mutuelle, qui a comme paramètres les sémantiques opérationnelles de deux langages ainsi qu'une relation de similitude entre états des programmes. Le système déductif est correct: lorsqu'il termine, il démontre l'équivalence des programmes qui lui sont donnés en entrée. Nous l'illustrons sur deux programmes, appartenant à des langages différents : l'un impératif, l'autre fonctionnel, qui calculent la séquence de Collatz de deux manières différentes