Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis

The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure and hence conclude the decidability of the safety problem. Although backward reachability is property-directed, it can unnecessarily explore (large) portions of the state space of a system which are not required to verify the safety property under consideration. To avoid this, invariants can be used to dramatically prune the search space. Indeed, the problem is to guess such appropriate invariants. In this paper, we present a fully declarative and symbolic approach to the mechanization of backward reachability of infinite state systems manipulating arrays by Satisfiability Modulo Theories solving. Theories are used to specify the topology and the data manipulated by the system. We identify sufficient conditions on the theories to ensure the termination of backward reachability and we show the completeness of a method for invariant synthesis (obtained as the dual of backward reachability), again, under suitable hypotheses on the theories. We also present a pragmatic approach to interleave invariant synthesis and backward reachability so that a fix-point for the set of backward reachable states is more easily obtained. Finally, we discuss heuristics that allow us to derive an implementation of the techniques in the model checker MCMT, showing remarkable speed-ups on a significant set of safety problems extracted from a variety of sources.Comment: Accepted for publication in Logical Methods in Computer Scienc

Kleene Algebras and Semimodules for Energy Problems

With the purpose of unifying a number of approaches to energy problems found in the literature, we introduce generalized energy automata. These are finite automata whose edges are labeled with energy functions that define how energy levels evolve during transitions. Uncovering a close connection between energy problems and reachability and B\"uchi acceptance for semiring-weighted automata, we show that these generalized energy problems are decidable. We also provide complexity results for important special cases

Crime in Maine 2014

Automata over infinite alphabets have recently come to be studied extensively as potentially useful tools for solving problems in verification and database theory. One popular model of automata studied is the Class Memory Automata (CMA), for which the emptiness problem is equivalent to Petri Net Reachability. We identify a restriction - which we call weakness - of CMA, and show that their emptiness problem is equivalent to Petri Net Coverability. Further, we show that in the deterministic case they are closed under all Boolean operations. We clarify the connections between weak CMA and existing automata over data languages. We also extend CMA to operate over multiple levels of nested data values, and show that while these have undecidable emptiness in general, adding the weakness constraint recovers decidability of emptiness, via reduction to coverability in well-structured transition systems. We also examine connections with existing automata over nested data.Comment: Preprint of LATA'15 pape

Parameterized Verification of Safety Properties in Ad Hoc Network Protocols

We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider a decision problem that can be expressed as the verification of the existence of an initial topology in which the execution of the protocol can lead to a configuration with at least one node in a certain state. The decision problem is parametric both on the size and on the form of the communication topology of the initial configurations. We draw a complete picture of the decidability and complexity boundaries of this problem according to various assumptions on the possible topologies.Comment: In Proceedings PACO 2011, arXiv:1108.145

Research Plan and Preliminary Results - A Field Research Site for Emerging Contaminants in Iowa

Research has recently documented the prevalence of a wide variety of pharmaceuticals and other emerging contaminants (ECs) in streams across the United States. Wastewater treatment plants (WWTPs) have been found to be an important source and collection point of ECs to streams as many ECs are incompletely removed during treatment. To investigate the complex instream processes (e.g., dilution, sorption, degradation, dispersion, etc.) chat can affect ECs following their input from a WWTP and determining if such input is having an effect on the aquatic ecosystem requires the integration of multi-disciplinary efforts at a carefully selected field site. Preliminary work has identified an 8-km reach of Fourmile Creek in central Iowa as an ideal research site to investigate such important research questions pertaining to ECs. Unique aspects of Fourmile Creek included: (1) a single source effluent-dominated scream, (2) background data document the input of a wide variety of ECs from WWTP discharge, (3) small basin size, (4) relatively simple flow system, (5) background data suggest that undefined processes are taking place decreasing the level of select ECs during stream transport, (6) the WWTP uses a treatment technology (activated sludge) typical of many towns in Iowa and the United States (7) a hydrogeologic setting of a low-gradient, small scream (average discharge less than 1.41 m3/s) in glacial drift is typical of many areas in Iowa and across the Midwest, and (8) the existence of a low-head dam approximately 2 km upstream of the WWTP outfall allowing more accurate above WWTP and below WWTP comparisons in aquatic ecosystems. Furthermore, the WWTP is scheduled to close by 2011 providing a unique opportunity to determine how stream hydrology, water chemistry and aquatic biota react to the removal of the primary source of flow and ECs in this system. This will allow a novel before and after assessment not previously available in EC research. Research to date at the site has included installation of a streamflow gauging station, dye-tracing tests (to determine water travel times), Lagrangian water-quality sampling at two flow/water temperature regimes, and sampling for ECs in bed sediment. Selected fish have been collected for analysis and identification. In addition, basic fish community and fish health assessment for different seasons and spawning conditions are being analyzed. The research framework is unique at Fourmile Creek for investigating the important question of how ECs are transported through the environment and if the presence of such compounds is having a deleterious effect on aquatic ecosystems

Modeling Time in Computing: A Taxonomy and a Comparative Survey

The increasing relevance of areas such as real-time and embedded systems, pervasive computing, hybrid systems control, and biological and social systems modeling is bringing a growing attention to the temporal aspects of computing, not only in the computer science domain, but also in more traditional fields of engineering. This article surveys various approaches to the formal modeling and analysis of the temporal features of computer-based systems, with a level of detail that is suitable also for non-specialists. In doing so, it provides a unifying framework, rather than just a comprehensive list of formalisms. The paper first lays out some key dimensions along which the various formalisms can be evaluated and compared. Then, a significant sample of formalisms for time modeling in computing are presented and discussed according to these dimensions. The adopted perspective is, to some extent, historical, going from "traditional" models and formalisms to more modern ones.Comment: More typos fixe

Collecting Psycholinguistic Response Time Data Using Amazon Mechanical Turk

Researchers in linguistics and related fields have recently begun exploiting online crowd-sourcing tools, like Amazon Mechanical Turk (AMT), to gather behavioral data. While this method has been successfully validated for various offline measures--grammaticality judgment or other forced-choice tasks--its use for mainstream psycholinguistic research remains limited. This is because psycholinguistic effects are often dependent on relatively small differences in response times, and there remains some doubt as to whether precise timing measurements can be gathered over the web. Here we show that three classic psycholinguistic effects can in fact be replicated using AMT in combination with open-source software for gathering response times client-side. Specifically, we find reliable effects of subject definiteness, filler-gap dependency processing, and agreement attraction in self-paced reading tasks using approximately the same numbers of participants and/or trials as similar laboratory studies. Our results suggest that psycholinguists can and should be taking advantage of AMT and similar online crowd-sourcing marketplaces as a fast, low-resource alternative to traditional laboratory research

Hierarchy of Scales in Language Dynamics

Methods and insights from statistical physics are finding an increasing variety of applications where one seeks to understand the emergent properties of a complex interacting system. One such area concerns the dynamics of language at a variety of levels of description, from the behaviour of individual agents learning simple artificial languages from each other, up to changes in the structure of languages shared by large groups of speakers over historical timescales. In this Colloquium, we survey a hierarchy of scales at which language and linguistic behaviour can be described, along with the main progress in understanding that has been made at each of them − much of which has come from the statistical physics community. We argue that future developments may arise by linking the different levels of the hierarchy together in a more coherent fashion, in particular where this allows more effective use of rich empirical data sets