We present a program logic, Lc, which modularly reasons about unstructured control flow in machine-language programs. Unlike previous program logics, the basic reasoning units in Lc are multipleentry and multiple-exit program fragments. Lc provides fine-grained composition rules to compose program fragments. It is not only useful for reasoning about unstructured control flow in machine language...

Comprehensive models of stochastic, clonally reproducing populations are defined in terms of general branching processes, allowing birth during maternal life, as for higher organisms, or by splitting, as in cell division. The populations are assumed to start small, by mutation or immigration, reproduce supercritically while smaller than the habitat carrying capacity but subcritically above it. ...

Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-hoc algorithms are used to suppress subterms on output. As a result, terms might be printed identically although they differ in hidden parts. Such ambiguous representations may confuse users. Additionally, terms might ...

Proof-producing program analysis augments the invariants inferred by an abstract interpreter with their correctness proofs. If these invariants are precise enough to guarantee safety, this method is an automatic verification tool. We present proof-synthesis algorithms for a simple flow chart language and domains V → V mapping variables to abstract values and discuss some benefits for proof carr...

In this paper, exact solution for two-plane transverse vibration analysis of axial-loaded multi-step Timoshenko rotor carrying concentrated masses is presented. Each attached element is considered to have both translational and rotational inertia. Forward and backward frequencies and corresponding modes are obtained using transfer matrix method (TMM). The effect of the angular velocity of spin,...