Avi Brisman, Bill McClanahan, Nigel South and Reece Walters (2018) Water, Crime and Security in the Twenty-First Century. London: Palgrave Macmillan.

Not applicabl

Algebraic totality, towards completeness

Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps. First, we recall definitions of finiteness spaces and describe their basic properties deduced from the general theory of linearly topologised spaces. Then we give an interpretation of LL based on linear algebra. Second, thanks to separation properties, we can introduce an algebraic notion of totality candidate in the framework of linearly topologised spaces: a totality candidate is a closed affine subspace which does not contain 0. We show that finiteness spaces with totality candidates constitute a model of classical LL. Finally, we give a barycentric simply typed lambda-calculus, with booleans ${\mathcal{B}}$ and a conditional operator, which can be interpreted in this model. We prove completeness at type ${\mathcal{B}}^n\to{\mathcal{B}}$ for every n by an algebraic method

Architectural mismatch tolerance

The integrity of complex software systems built from existing components is becoming more dependent on the integrity of the mechanisms used to interconnect these components and, in particular, on the ability of these mechanisms to cope with architectural mismatches that might exist between components. There is a need to detect and handle (i.e. to tolerate) architectural mismatches during runtime because in the majority of practical situations it is impossible to localize and correct all such mismatches during development time. When developing complex software systems, the problem is not only to identify the appropriate components, but also to make sure that these components are interconnected in a way that allows mismatches to be tolerated. The resulting architectural solution should be a system based on the existing components, which are independent in their nature, but are able to interact in well-understood ways. To find such a solution we apply general principles of fault tolerance to dealing with arch itectural mismatche

Brain region-specific expression of genes mapped within quantitative trait loci for behavioral responsiveness to acute stress in Fisher 344 and Wistar Kyoto male rats

Acute stress responsiveness is a quantitative trait that varies in severity from one individual to another; however, the genetic component underlying the individual variation is largely unknown. Fischer 344 (F344) and Wistar Kyoto (WKY) rat strains show large differences in behavioral responsiveness to acute stress, such as freezing behavior in response to footshock during the conditioning phase of contextual fear conditioning (CFC). Quantitative trait loci (QTL) have been identified for behavioral responsiveness to acute stress in the defensive burying (DB) and open field test (OFT) from a reciprocal F2 cross of F344 and WKY rat strains. These included a significant QTL on chromosome 6 (Stresp10). Here, we hypothesized that the Stresp10 region harbors genes with sequence variation(s) that contribute to differences in multiple behavioral response phenotypes between the F344 and WKY rat strains. To test this hypothesis, first we identified differentially expressed genes within the Stresp10 QTL in the hippocampus, amygdala, and frontal cortex of F344 and WKY male rats using genome-wide microarray analyses. Genes with both expression differences and non-synonymous sequence variations in their coding regions were considered candidate quantitative trait genes (QTGs). As a proof-of-concept, the F344.WKY-Stresp10 congenic strain was generated with the Stresp10 WKY donor region into the F344 recipient strain. This congenic strain showed behavioral phenotypes similar to those of WKYs. Expression patterns of Gpatch11 (G-patch domain containing 11), Cdkl4 (Cyclin dependent kinase like 4), and Drc1 (Dynein regulatory complex subunit 1) paralleled that of WKY in the F344.WKY-Stresp10 strain matching the behavioral profiles of WKY as opposed to F344 parental strains. We propose that these genes are candidate QTGs for behavioral responsiveness to acute stress

Understanding Needs, Breaking Down Barriers: Examining Mental Health Challenges and Well-Being of Correctional Staff in Ontario, Canada

Mental health challenges appear to be extremely prolific and challenging for correctional service employees, affecting persons working in community, institutional, and administrative correctional services. Focusing specifically on correctional workers employed by the Ontario Ministry of the Solicitor General, we shed light on their interpretations of the complexities of their occupational work and of how their work affects staff. Using a qualitative thematic approach to data analyses, we show that participants (n = 67) encounter barriers to treatment seeking, which they describe as tremendous, starting with benefits, wages, and shift work. We let the voices of staff elucidate what is needed to create a healthier correctional workforce. Recommendations include more training opportunities and programs; quarterly, semiannual, or annual appointments with a mental health professional who can assess changes in the mental health status of employees; offsite assessments to ensure confidentiality; and team building opportunities to reduce interpersonal conflict at work and increase moral by improving the work environment

A Lightweight Formalization of the Metatheory of Bisimulation-Up-To

International audienceBisimilarity of two processes is formally established by producing a bisimulation relation that contains those two processes and obeys certain closure properties. In many situations, particularly when the under-lying labeled transition system is unbounded, these bisimulation relations can be large and even infinite. The bisimulation-up-to technique has been developed to reduce the size of the relations being computed while retaining soundness, that is, the guarantee of the existence of a bisimulation. Such techniques are increasingly becoming a critical ingredient in the automated checking of bisimilarity. This paper is devoted to the formalization of the meta theory of several major bisimulation-up-to techniques for the process calculi CCS and the π-calculus (with replication). Our formalization is based on recent work on the proof theory of least and greatest fixpoints, particularly the use of relations defined (co-)inductively, and of co-inductive proofs about such relations, as implemented in the Abella theorem prover. An important feature of our formalization is that our definitions of the bisimulation-up-to relations are, in most cases, straightforward translations of published informal definitions, and our proofs clarify several technical details of the informal descriptions. Since the logic behind Abella also supports λ-tree syntax and generic reasoning using the ∇-quantifier, our treatment of the π-calculus is both direct and natural

Block public access: Trust safety verification of access control policies

© 2020 Owner/Author. Data stored in cloud services is highly sensitive and so access to it is controlled via policies written in domain-specific languages (DSLs). The expressiveness of these DSLs provides users flexibility to cover a wide variety of uses cases, however, unintended misconfigurations can lead to potential security issues. We introduce Block Public Access, a tool that formally verifies policies to ensure that they only allow access to trusted principals, i.e. that they prohibit access to the general public. To this end, we formalize the notion of Trust Safety that formally characterizes whether or not a policy allows unconstrained (public) access. Next, we present a method to compile the policy down to a logical formula whose unsatisfiability can be (1) checked by SMT and (2) ensures Trust Safety. The constructs of the policy DSLs render unsatisfiability checking PSPACE-complete, which precludes verifying the millions of requests per second seen at cloud scale. Hence, we present an approach that leverages the structure of the policy DSL to compute a much smaller residual policy that corresponds only to untrusted accesses. Our approach allows Block Public Access to, in the common case, syntactically verify Trust Safety without having to query the SMT solver. We have implemented Block Public Access and present an evaluation showing how the above optimization yields a low-latency policy verifier that the S3 team at AWS has integrated into their authorization system, where it is currently in production, analyzing millions of policies everyday to ensure that client buckets do not grant unintended public access

Stratified Abstraction of Access Control Policies

The shift to cloud-based APIs has made application security critically depend on understanding and reasoning about policies that regulate access to cloud resources. We present stratified predicate abstraction, a new approach that summarizes complex security policies into a compact set of positive and declarative statements that precisely state who has access to a resource. We have implemented stratified abstraction and deployed it as the engine powering AWS’s IAM Access Analyzer service, and hence, demonstrate how formal methods and SMT can be used for security policy explanation

Enhanced Graph Rewriting Systems for Complex Software Domain

International audienceMethodologies for correct by construction reconfigurations can efficiently solve consistency issues in dynamic software architecture. Graph-based models are appropriate for designing such architectures and methods. At the same time, they may be unfit to characterize a system from a non functional perspective. This stems from efficiency and applicability limitations in handling time-varying characteristics and their related dependencies. In order to lift these restrictions, an extension to graph rewriting systems is proposed herein. The suitability of this approach, as well as the restraints of currently available ones, are illustrated, analysed and experimentally evaluated with reference to a concrete example. This investigation demonstrates that the conceived solution can: (i) express any kind of algebraic dependencies between evolving requirements and properties; (ii) significantly ameliorate the efficiency and scalability of system modifications with respect to classic methodologies; (iii) provide an efficient access to attribute values; (iv) be fruitfully exploited in software management systems; (v) guarantee theoretical properties of a grammar, like its termination

Formal Model-Based Assurance Cases in Isabelle/SACM : An Autonomous Underwater Vehicle Case Study

Isabelle/SACM is a tool for automated construction of model-based assurance cases with integrated formal methods, based on the Isabelle proof assistant. Assurance cases show how a system is safe to operate, through a human comprehensible argument demonstrating that the requirements are satisfied, using evidence of various provenances. They are usually required for certification of critical systems, often with evidence that originates from formal methods. Automating assurance cases increases rigour, and helps with maintenance and evolution. In this paper we apply Isabelle/SACM to a fragment of the assurance case for an autonomous underwater vehicle demonstrator. We encode the metric unit system (SI) in Isabelle, to allow modelling requirements and state spaces using physical units. We develop a behavioural model in the graphical RoboChart state machine language, embed the artifacts into Isabelle/SACM, and use it to demonstrate satisfaction of the requirements