An update on the status of wet forest stream-dwelling frogs of the Eungella region

Eungella’s wet forests are home to a number of stream-breeding frogs including three species endemic to the Eungella region: the Eungella dayfrog (Taudactylus eungellensis), Eungella tinkerfrog (T. liemi), and northern gastric brooding frog (Rheobatrachus vitellinus). During the mid-1980s, T. eungellensis and R. vitellinus suffered dramatic population declines attributable to amphibian chytridiomycosis, a disease caused by the amphibian chytrid fungus (Batrachochytrium dendrobatidis or Bd). While surveys in the late 1980s failed to locate T. eungellensis or R. vitellinus, populations of the former were located on a handful of streams surveyed by researchers in the mid-to-late 1990s. Between January 2000 and November 2015, additional surveys targeting these and other wet forest frog species were conducted at 114 sites within Eungella National Park and adjoining areas of State Forest. During these surveys, we located T. eungellensis at many more sites than surveys in the 1990s. Abundances of T. eungellensis at these sites were typically low, however, and well below abundance levels prior to declines in the mid-1980s. As with surveys in the 1990s, T. eungellensis was scarce at high-elevation sites above 600 metres altitude. Numbers of this species do not appear to have increased significantly since the mid-1990s, suggesting recovery of T. eungellensis populations is occurring slowly, at best. In contrast with T. eungellensis, T. liemi was frequently recorded at high-elevation sites, albeit at low densities. As with previous surveys, surveys during 2000–2015 were unsuccessful in locating R. vitellinus. Further frog surveys and monitoring (including disease surveillance) are needed to better assess the status of stream frogs at Eungella, and to understand the influence of Bd on the abundance and distribution of threatened stream-dwelling frogs at Eungella

Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom

We consider the problem of verifying deadlock freedom for symmetric cache coherence protocols. In particular, we focus on a specific form of deadlock which is useful for the cache coherence protocol domain and consistent with the internal definition of deadlock in the Murphi model checker: we refer to this deadlock as a system- wide deadlock (s-deadlock). In s-deadlock, the entire system gets blocked and is unable to make any transition. Cache coherence protocols consist of N symmetric cache agents, where N is an unbounded parameter; thus the verification of s-deadlock freedom is naturally a parameterized verification problem. Parametrized verification techniques work by using sound abstractions to reduce the unbounded model to a bounded model. Efficient abstractions which work well for industrial scale protocols typically bound the model by replacing the state of most of the agents by an abstract environment, while keeping just one or two agents as is. However, leveraging such efficient abstractions becomes a challenge for s-deadlock: a violation of s-deadlock is a state in which the transitions of all of the unbounded number of agents cannot occur and so a simple abstraction like the one above will not preserve this violation. In this work we address this challenge by presenting a technique which leverages high-level information about the protocols, in the form of message sequence dia- grams referred to as flows, for constructing invariants that are collectively stronger than s-deadlock. Efficient abstractions can be constructed to verify these invariants. We successfully verify the German and Flash protocols using our technique

Deciding Full Branching Time Logic by Program Transformation

We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL*) properties of finite state reactive systems. The finite state systems and the CTL* properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and the given property, into a monadic ω -program, that is, a stratified program defining nullary or unary predicates on infinite lists. This transformation is performed by applying unfold/fold rules that preserve the perfect model of the initial program. In the second step we verify the property of interest by using a proof method for monadic ω-program

On the Hybrid Extension of CTL and CTL+

The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branching-time logics CTL and CTL+ by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that H1CTL+ and H1CTL, the hybrid extensions with one variable of CTL+ and CTL, respectively, are expressively equivalent but H1CTL+ is exponentially more succinct than H1CTL. On the other hand, HCTL+, the hybrid extension of CTL with arbitrarily many variables does not capture CTL*, as it even cannot express the simple CTL* property EGFp. The satisfiability problem for H1CTL+ is complete for triply exponential time, this remains true for quite weak fragments and quite strong extensions of the logic

Comparison of the effects of exploitation on theoretical long-lived fish species with different life-history strategies and the implications for management

This article was originally published by ICES on their website http://www.ices.dk/.A stage-based simulation model is used to investigate the effect of exploitation on theoretical populations representing long-lived elasmobranch and teleost species with different life-history strategies. A comparison is made between the effect of exploitation on the elasmobranch ‘k-strategists’ and other teleost species that are ‘r-strategists’. We demonstrate the effects of stage-based exploitation on a typical long-lived elasmobranch population and discuss the implications of this when designing a management plan to ensure survival of the stock

Vocal communication in gibbons

Many non-human primates use vocal communication referentially and also use simple syntax and grammar. However, their comparative vocal repertoires are disappointingly sparse, with many researchers concluding that they have fixed vocal patterns made up of a limited number of discrete units used in a relatively small array of contexts (see McComb & Semple, 2005 for a review). Furthermore, these vocal patterns seem to be innate, under high genetic control with little evidence for vocal learning – something that humans are masters at (Janik & Slater 1997). This leaves us with some questions. Firstly, how did humans become so adept at producing and learning vocal sounds? And, secondly, are there any extant primate species with vocal behaviours that can be directly compared to our own?

Inheritance of Temporal Logic Properties

Abstract. Inheritance is one of the key features for the success of object-oriented languages. Inheritance (or specialisation) supports incremental design and re-use of already written specifications or programs. In a for-mal approach to system design the interest does not only lie in re-use of class definitions but also in re-use of correctness proofs. If a provably correct class is specialised we like to know those correctness properties which are preserved in the subclass. This can avoid re-verification of already proven properties and may thus substantially reduce the verifi-cation effort. In this paper we study the question of inheritance of correctness prop-erties in the context of state-based formalisms, using a temporal logic (CTL) to formalise requirements on classes. Given a superclass and its specialised subclass we develop a technique for computing the set of for-mulas which are preserved in the subclass. For specialisation we allow addition of attributes, modification of existing as well as extension with new methods.

Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking

One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for the orbit relation. Dynamic symmetry reduction calculates representatives of equivalence classes of states dynamically and thus avoids the construction of the orbit relation. In this paper, we present a new efficient model checking algorithm based on dynamic symmetry reduction. Our experiments show that the algorithm is very fast and allows the verification of larger systems. We additionally implemented the use of state symmetries for symbolic symmetry reduction. To our knowledge we are the first who investigated state symmetries in combination with BDD based symbolic model checking

Extended Computation Tree Logic

We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may determine the moments along a path that an until property may be fulfilled. We consider several classes of languages leading to logics with different expressive power and complexity, whose importance is motivated by their use in model checking, synthesis, abstract interpretation, etc. We show that even with context-free languages on the until operator the logic still allows for polynomial time model-checking despite the significant increase in expressive power. This makes the logic a promising candidate for applications in verification. In addition, we analyse the complexity of satisfiability and compare the expressive power of these logics to CTL* and extensions of PDL