No abstract

This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages, referred to as all-path reachability logic. It derives partial-correctness properties with all-path semantics (a state satisfying a given precondition reaches states satisfying a given postcondition on all terminating execution paths). The proof system takes as axioms any unconditional operational semantics, and is sound (partially correct) and (relatively) complete, independent of the object language. The soundness has also been mechanized in Coq. This approach is implemented in a tool for semantics-based verification as part of the K framework

No abstract

No abstract

No abstract

No abstract

The effects upon the drift velocity and electron temperatures in silicon inversion layers due to interfacial polar-mode phonons in the Si/SiO2 interface have been calculated at various temperatures. These calculations were carried out at 77, 150, and 300 K using a three-energy-level model for transport in the quasi-two-dimensional inversion layer assuming a drifted-Maxwellian distribution. The effects of the polar interface phonon scattering are compared to the effects of scattering due to Si bulk phonons, interface charges, and interface roughness. The effects of the remote phonons are found to be small in the drift velocity, but are significant as an energy relaxation mechanism at high fields and large inversion densities.

We present a novel program verification approach based on coinduction, which takes as input an operational semantics. No intermediates like program logics or verification condition generators are needed. Specifications can be written using any state predicates. We implement our approach in Coq, giving a certifying language-independent verification framework. Our proof system is implemented as a single module imported unchanged into language-specific proofs. Automation is reached by instantiating a generic heuristic with language-specific tactics. Manual assistance is also smoothly allowed at points the automation cannot handle. We demonstrate the power and versatility of our approach by verifying algorithms as complicated as Schorr-Waite graph marking and instantiating our framework for object languages in several styles of semantics. Finally, we show that our coinductive approach subsumes reachability logic, a recent language-independent sound and (relatively) complete logic for program verification that has been instantiated with operational semantics of languages as complex as C, Java and JavaScript.