Cleanly combining specialised program analysers

Automatically proving that (infinite-state) software programs satisfy a specification is an important task, but has proved very difficult. Thus, in order to obtain techniques that work with reasonable speed and without user guidance, researchers have typically targeted restricted classes of language features, programming idioms and properties. We have designed a system in which several of these specialised techniques can be used together in proving that a program is correct; this is done without breaking modularity by propagating information between the analyses, expressed as formulae of an expressive common logic. In this way, we can verify programs which, because they use diverse language features and idioms, are difficult or impossible to prove using any one individual technique. Our system is implemented in the experimental tool HECTOR

p-automata: acceptors for Markov Chains

We present p-automata, which accept an entire Markov chain as input. Acceptance is determined by solving a sequence of stochastic weak and weak games. The set of languages of Markov chains obtained in this way is closed under Boolean operations. Language emptiness and containment are equi-solvable, and languages themselves are closed under bisimulation. A Markov chain (respectively, PCTL formula) determines a p-automaton whose language is the bisimulation equivalence class of that Markov chain (respectively, the set of models of that formula). We define a simulation game between p-automata, decidable in EXPTIME. Simulation under-approximates language containment, whose decidability status is presently unknown

High-κ\kappa field-effect transistor with copper-phthalocyanine

The use of SrTiO$_3$ dielectrics as high-permittivity insulator in organic thin film field effect transistors (FET) is evaluated. Field-effect transistors with sputtered SrTiO$_3$ and copper-phthalocyanine (CuPc) as semiconducting layer were fabricated. The device preparation was performed in-situ in an ultra high vacuum chamber system. The dielectric in the transistors had a permittivity of up to 200 which led to low driving voltages of 3 V. The field effect transistors were p-type and reached mobilities of about $\mu = 1.5\times 10^{-3}$ cm$^2$/Vs and an on/off ratio of $10^3$. These properties are compared to devices based on other dielectric materials.Comment: 9 pages, 6 figure

Effectiveness of 4 Pulpotomy Techniques—Randomized Controlled Trial

Pulpotomy is the accepted therapy for the management of cariously exposed pulps in symptom-free primary molars; however, evidence is lacking about the most appropriate technique. The aim of this study was to compare the relative effectiveness of the Er:YAG laser, calcium hydroxide, and ferric sulfate techniques with that of dilute formocresol in retaining such molars symptom-free. Two hundred primary molars in 107 healthy children were included and randomly allocated to one of the techniques. The treated teeth were blindly re-evaluated after 6, 12, 18, and 24 months. Descriptive data analysis and logistic regression analysis, accounting for each patient's effect by a generalized estimating equation (GEE), were used. After 24 months, the following total and clinical success rates were determined (%): formocresol 85 (96), laser 78 (93), calcium hydroxide 53 (87), and ferric sulfate 86 (100). Only calcium hydroxide performed significantly worse than formocresol (p = 0.001, odds ratio = 5.6, 95% confidence interval 2.0-15.5). In conclusion, calcium hydroxide is less appropriate for pulpotomies than is formocresol

Fatal attractors in parity games

We study a new form of attractor in parity games and use it to define solvers that run in PTIME and are partial in that they do not solve all games completely. Technically, for color c this new attractor determines whether player c%2 can reach a set of nodes X of color c whilst avoiding any nodes of color less than c. Such an attractor is fatal if player c%2 can attract all nodes in X back to X in this manner. Our partial solvers detect fixed-points of nodes based on fatal attractors and correctly classify such nodes as won by player c%2. Experimental results show that our partial solvers completely solve benchmarks that were constructed to challenge existing full solvers. Our partial solvers also have encouraging run times. For one partial solver we prove that its runtime is in O(|V |3), that its output game is independent of the order in which attractors are computed, and that it solves all B¨uchi games

Implications of deep drainage through saline clay for groundwater recharge and sustainable cropping in a semi-arid catchment, Australia

The magnitude and timing of deep drainage and salt leaching through clay soils is a critical issue for dryland agriculture in semi-arid regions (<500 mm yr<sup>−1</sup> rainfall, potential evapotranspiration >2000 mm yr<sup>−1</sup>) such as parts of Australia's Murray-Darling Basin (MDB). In this rare study, hydrogeological measurements and estimations of the historic water balance of crops grown on overlying Grey Vertosols were combined to estimate the contribution of deep drainage below crop roots to recharge and salinization of shallow groundwater. Soil sampling at two sites on the alluvial flood plain of the Lower Namoi catchment revealed significant peaks in chloride concentrations at 0.8–1.2 m depth under perennial vegetation and at 2.0–2.5 m depth under continuous cropping indicating deep drainage and salt leaching since conversion to cropping. Total salt loads of 91–229 t ha<sup>−1</sup> NaCl equivalent were measured for perennial vegetation and cropping, with salinity to ≥ 10 m depth that was not detected by shallow soil surveys. Groundwater salinity varied spatially from 910 to 2430 mS m<sup>−1</sup> at 21 to 37 m depth (<i>N</i> = 5), whereas deeper groundwater was less saline (290 mS m<sup>−1</sup>) with use restricted to livestock and rural domestic supplies in this area. The Agricultural Production Systems Simulator (APSIM) software package predicted deep drainage of 3.3–9.5 mm yr<sup>−1</sup> (0.7–2.1% rainfall) based on site records of grain yields, rainfall, salt leaching and soil properties. Predicted deep drainage was highly episodic, dependent on rainfall and antecedent soil water content, and over a 39 yr period was restricted mainly to the record wet winter of 1998. During the study period, groundwater levels were unresponsive to major rainfall events (70 and 190 mm total), and most piezometers at about 18 m depth remained dry. In this area, at this time, recharge appears to be negligible due to low rainfall and large potential evapotranspiration, transient hydrological conditions after changes in land use and a thick clay dominated vadose zone. <br><br> This is in contrast to regional groundwater modelling that assumes annual recharge of 0.5% of rainfall. Importantly, it was found that leaching from episodic deep drainage could not cause discharge of saline groundwater in the area, since the water table was several meters below the incised river bed

Bounded analysis of constrained dynamical systems: a case study in nuclear arms control

We introduce a simple dynamical system that describes key features of a bilateral nuclear arms control regime. The evolution of each party's beliefs and declarations under the regime are represented, and the e ects of inspection processes are captured. Bounded analysis of this model allows us to explore { within a nite horizon { the consequences of changes to the rules of the arms control process and to the strategies of each party, bounded scope invariants for variables of interest, and dynamics for initial states containing strict uncertainty. Together these would potentially enable a decision support system to consider cases of interest irrespective of unknowns. We realize such abilities by building a Python package that draws on the capabilities of a Satis ability Modulo Theory (SMT) solver to explore particular scenarios and to optimize measures of interest { such as the belief of one nation in the statements made by another, or the timing of an unscheduled inspection such that it has maximum value. We show that these capabilities can in principle support the design or assessment of future bilateral arms control instruments by applying them to a set of representative and relevant test scenarios with realistic nite horizons

PCTL Model Checking of Markov Chains: Truth and Falsity as Winning Strategies in Games

Probabilistic model checking is a technique for verifying whether a model such as a Markov chain satisfies a probabilistic, behavioral property – e.g. “with probability at least 0.999, a device will be elected leader. ” Such properties are expressible in probabilistic temporal logics, e.g. PCTL, and efficient algorithms exist for checking whether these formulae are true or false on finite-state models. Alas, these algorithms don’t supply diagnostic information for why a probabilistic property does or does not hold in a given model. We provide here complete and rigorous foundations for such diagnostics in the setting of countable labeled Markov chains and PCTL. For each model and PCTL formula, we define a game between a Verifier and a Refuter that is won by Verifier if the formula holds in the model, and won by Refuter if it doesn’t hold. Games are won by exactly one player, through monotone strategies that encode the diagnostic information for truth and falsity (respectively). These games are infinite with Büchi type acceptance conditions where simpler fairness conditions are shown not be to sufficient. Verifier can always force finite plays for certain PCTL formulae, suggesting the existence of finite-state abstractions of models that satisfy such formulae