Mechanized nanoparticles (MNPs) consisting of supramolecular machines attached to the surface of mesoporous silica nanoparticles are designed to release encapsulated guest molecules controllably under pH activation. The molecular machines are comprised of cucurbit[6]uril (CB[6]) rings that encircle tethered trisammonium stalks and can be tuned to respond under specific pH conditions through che...

We face the problem of obtaining a certified version of a crucial algorithm in the field of Homological Algebra, known as “Perturbation Lemma”. This lemma is intensively used in the software system “Kenzo”, devoted to symbolic computation in Homological Algebra. To this end, we use the proof assistant “Isabelle”. Our main motivations are to increase the knowledge in the algorithmic nature of th...

The formal verification of compilers and related programming tools depends crucially on the availability of appropriate mechanized semantics for the source, intermediate and target languages. In this invited talk, I review various forms of operational semantics and their mechanization, based on my experience with the formal verification of the CompCert C compiler. What does this program do, exa...

The following outline summarizes some suggestions about ways in which translation may be mechanized that were worked out by the authors in 19481952. The treatment is not exhaustive, and many modifications in detail would certainly be necessary should the ideas here mooted be put into active operation. It is considered, however, that it would be serviceable to describe the techniques here envisa...

Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arguments. Using concepts from the theory of tree transducers and extending on earlier work, the paper develops automatic transformations from accumulative functional programs into nonaccumulative ones, which are much bett...

Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one representative example. With context operations occurring hundreds to thousands of times per second on every computer, their correctness deserves careful examination. Given the small and stable code bases, it is a commo...