TLA+ Proofs

TLA+ is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA+ proofs and check them with TLAPS, the TLA+ Proof System. We use Peterson's mutual exclusion algorithm as a simple example to describe the features of TLAPS and show how it and the Toolbox (an IDE for TLA+) help users to manage large, complex proofs.Comment: A shorter version of this article appeared in the proceedings of the conference Formal Methods 2012 (FM 2012, Paris, France, Springer LNCS 7436, pp. 147-154

Verifying Safety Properties With the TLA+ Proof System

TLAPS, the TLA+ proof system, is a platform for the development and mechanical verification of TLA+ proofs written in a declarative style requiring little background beyond elementary mathematics. The language supports hierarchical and non-linear proof construction and verification, and it is independent of any verification tool or strategy. A Proof Manager uses backend verifiers such as theorem provers, proof assistants, SMT solvers, and decision procedures to check TLA+ proofs. This paper documents the first public release of TLAPS, distributed with a BSD-like license. It handles almost all the non-temporal part of TLA+ as well as the temporal reasoning needed to prove standard safety properties, in particular invariance and step simulation, but not liveness properties

Comparing estimation methods for spatial econometrics techniques using R.

Recent advances in spatial econometrics model fitting techniques have made it more desirable to be able to compare results and timings. Results should correspond between implementations using different applications, while timings are more readily compared within a single application. A broad range of model fitting techniques are provided by the contributed R packages for spatial econometrics. These model fitting techniques are associated with methods for estimating impacts and some tests, which will also be presented and compared. This review constitutes an up-to-date demonstration of techniques now available in R, and mentions some that will shortly become more generally available.Spatial autoregression; Econometric software.

From Temporal Models to Property-Based Testing

This paper presents a framework to apply property-based testing (PBT) on top of temporal formal models. The aim of this work is to help software engineers to understand temporal models that are presented formally and to make use of the advantages of formal methods: the core time-based constructs of a formal method are schematically translated to the BeSpaceD extension of the Scala programming language. This allows us to have an executable Scala code that corresponds to the formal model, as well as to perform PBT of the models functionality. To model temporal properties of the systems, in the current work we focus on two formal languages, TLA+ and FocusST.Comment: Preprint. Accepted to the 12th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE 2017). Final version published by SCITEPRESS, http://www.scitepress.or

Formal Executable Models for Automatic Detection of Timing Anomalies

A timing anomaly is a counterintuitive timing behavior in the sense that a local fast execution slows down an overall global execution. The presence of such behaviors is inconvenient for the WCET analysis which requires, via abstractions, a certain monotony property to compute safe bounds. In this paper we explore how to systematically execute a previously proposed formal definition of timing anomalies. We ground our work on formal designs of architecture models upon which we employ guided model checking techniques. Our goal is towards the automatic detection of timing anomalies in given computer architecture designs

Adiabatic Elimination in Compound Quantum Systems with Feedback

Feedback in compound quantum systems is effected by using the output from one sub-system (``the system'') to control the evolution of a second sub-system (``the ancilla'') which is reversibly coupled to the system. In the limit where the ancilla responds to fluctuations on a much shorter time scale than does the system, we show that it can be adiabatically eliminated, yielding a master equation for the system alone. This is very significant as it decreases the necessary basis size for numerical simulation and allows the effect of the ancilla to be understood more easily. We consider two types of ancilla: a two-level ancilla (e.g. a two-level atom) and an infinite-level ancilla (e.g. an optical mode). For each, we consider two forms of feedback: coherent (for which a quantum mechanical description of the feedback loop is required) and incoherent (for which a classical description is sufficient). We test the master equations we obtain using numerical simulation of the full dynamics of the compound system. For the system (a parametric oscillator) and feedback (intensity-dependent detuning) we choose, good agreement is found in the limit of heavy damping of the ancilla. We discuss the relation of our work to previous work on feedback in compound quantum systems, and also to previous work on adiabatic elimination in general.Comment: 18 pages, 12 figures including two subplots as jpeg attachment

Straightforward synthesis of functionalized cyclic polymers in high yield via RAFT and thiolactone-disulfide chemistry

An efficient synthetic pathway toward cyclic polymers based on the combination of thiolactone and disulfide chemistry has been developed. First, heterotelechelic linear polystyrene (PS) containing an alpha-thiolactone (TLa) and an omega-dithiobenzoate group was synthesized via reversible addition-fragmentation chain transfer (RAFT) polymerization, employing a newly designed TLa-bearing chain transfer agent (CTA). The subsequent reaction of this heterotelechelic polymer with an amine, which acts as a nucleophile for both the TLa and dithiobenzoate units, generated the alpha,omega-thiol-telechelic PS under ambient conditions without the need for any catalyst or other additives. The arrangement of thiols under a high dilution afforded single cyclic PS (c-PS) through an oxidative disulfide linkage. The cyclic PS (c-PS) disulfide ring formation was evidenced by SEC, MALDI-TOF MS and H-1-NMR characterization. Moreover, we demonstrated a controlled ring opening via either disulfide reduction or thiol-disulfide exchange to enable easy and clean topology transformation. Furthermore, to illustrate the broad utility of this synthetic methodology, different amines including functional ones were employed, allowing for the one-step preparation of functionalized cyclic polymers with high yields