3-valued models have been advocated as a means of system abstraction such that verifications and refutations of temporal-logic properties transfer from abstract models to the systems they represent. Some application domains, however, require multiple models of a concrete or virtual system. We build the mathematical foundations for 3-valued property verification and refutation applied to sets of...

A spreadsheet based program is presented to perform an independent Monitor Unit (MU) calculation verification for the Quality Assurance (QA) of Intensity Modulated Radiation Therapy (IMRT) using Dynamic MultiLeaf Collimation (DMLC). The computed dose value is compared to the planned dose by calculating the percent dose difference per Intensity Modulated Beam (IMB) and absolute dose difference p...

The ability to create and analyze abstract models is an important step in conquering software complexity. In this paper, we show that it is practical to verify dynamic properties of infinite state models expressed in a subset of CTL directly using an SMT solver without iteration, abstraction, or human intervention. We call this subset CTLlive and it consists of the operators of CTL expressible ...

We identify the topological Hochschild homology (THH) of the Thom spectrum associated to an E∞ classifying map X → BG, for G an appropriate group or monoid (e.g. U , O, and F ). We deduce the comparison from the observation of McClure, Schwanzl, and Vogt that THH of a cofibrant commutative S-algebra (E∞ ring spectrum) R can be described as an indexed colimit together with a verification that th...

We report on muonium (Mu) emission into vacuum following μ(+) implantation in mesoporous thin SiO(2) films. We obtain a yield of Mu into vacuum of (38±4)% at 250 K and (20±4)% at 100 K for 5 keV μ(+) implantation energy. From the implantation energy dependence of the Mu vacuum yield we determine the Mu diffusion constants in these films: D(Mu)(250 K)=(1.6±0.1)×10(-4)  cm(2)/s and D(Mu)(100 K)=(...

Recent advances in logic programming have been successfully used to build practical verification toolsets, as evidenced by the XMC system. Thus far, XMC has supported value-passing process languages, but has been limited to using the propositional fragment of modal mucalculus as the property specification logic. In this paper, we explore the use of data variables in the property logic. In parti...

The Mu transposon system of maize is highly active, with each of the approximately 50-100 copies transposing on average once each generation. The approximately one dozen distinct Mu transposons contain highly similar approximately 215 bp terminal inverted repeats (TIRs) and generate 9-bp target site duplications (TSDs) upon insertion. Using a novel genome walking strategy that uses these conser...

The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the modal mu-calculus. The known upper bound is NP intersection co-NP, but no polynomial algorithm is known. It was shown that on tree-like graphs (of bounded tree-width and DAG-width) a polynomial-time algorithm does exist. ...

Model checking involves exploring state-space of system model and automatically proving or disproving the correct functionality of the system. Verification of all properties may not require exploration of the state-space in its entirety. However, traditional model checkers are not equipped with enough knowledge of the system apriori to make smart decisions so as to explore only those portions o...