A rely/guarantee specification for a program P is a specification of the form R D G (R implies G), where R is a rely condition and G is a guarantee condition. A rely condition expresses the conditions that P relies on its environment to provide, and a guarantee condition expresses what P guarantees to provide in return. This paper presents a proof technique that permits us to infer that a progr...

The current Tactical Combat Casualty Care (TCCC) Guidelines recommend parenteral promethazine as the single agent for the treatment of opioid-induced nausea and/or vomiting and give a secondary indication of “synergistic analgesic effect.” Promethazine, however, has a well-documented history of undesired side effects relating to impairment and dysregulation of the central and autonomic nervous ...

The concurrent refinement algebra developed here is designed to provide a foundation for rely/guarantee reasoning about concurrent programs. The algebra builds on a complete lattice of commands by providing sequential composition, parallel composition and a novel weak conjunction operator. The weak conjunction operator coincides with the lattice supremum providing its arguments are non-aborting...

VeriFast is a verifier for single-threaded and multithreaded C and Java programs. It takes a C or Java program annotated with preconditions and postconditions in a separation logic notation, and verifies statically that these preconditions and postconditions hold, using symbolic execution. In plain separation logic, a thread either has full ownership of a memory location and knows the value at ...

Reasoning about side effects and aliasing is the heart of verifyingimperative programs. Unrestricted side effects through one refer-ence can invalidate assumptions about an alias. We present a newtype system approach to reasoning about safe assumptions in thepresence of aliasing and side effects, unifying ideas from referenceimmutability type systems and rely-guarantee progr...

We use a variety of consumer-producer specifications to illustrate the range of choices and rationale that arise in concurrent specifications using rely-guarantee. We also extend postconditions with a new argument to make explicit the environment assigned to the process, and present a semantics for possible values that explores the new parameter in postconditions. All specifications presented i...

Let $[X,\lambda]$ be a principally polarized abelian variety over finite field with commutative endomorphism ring; further suppose that either $X$ is ordinary or the prime. Motivated by an equidistribution heuristic, we introduce factor $\nu_v([X,\lambda])$ for each place $v$ of $\mathbb Q$, and show product these factors essentially computes size isogeny class $[X,\lambda]$. The derivation thi...

This paper describes a technique of expression decomposition which allows the use of rely/guarantee development rules that do not assume atomic expression evaluation. This decomposition provides a means of addressing the fact that the logical meaning of expressions relative to a single state and the semantic evaluation of expressions in a fine-grained concurrent language do not provide the same...