We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as finite-state process descriptions. We use as algorithmic description language Pidgin ML, a core applicative subset of Objective Caml. Dedicated to Zohar Manna for his 2th birthday

Using the synthesis approach of Manna and Waldinger, a formally specified and verified control circuitery for a production cell was developped. Building an appropriate formal language level, we could achieve a requirements specification to the informal description. We demonstrated that the paradigm of deductive synthesis can be applied to the development of complete verified systems, including ...

This research note outlines an alternative proof of the well-foundedness of the nested multiset ordering. It is first shown that the set M∗(S) of nested multisets over a given base set S forms a cumulative type structure. Then, by exploiting the notion of sets bounded in rank, it is proved that (M∗(S), >>∗) is well-founded if and only if (S, >) is well-founded, where >>∗denotes a nested multise...

We propose extending constraint solvers with multiset variables. That is, variables whose values are multisets. Such an extension can help prevent introducing unnecessary symmetry into a model. We identify a number of different representations for multiset variables, and suggest primitive and global constraints on multiset variables. Surprisingly, unlike finite domain variables, decomposition o...

Rewriting induction (Reddy, 1990) is an automated proof method for inductive theorems of term rewriting systems. Reasoning by the rewriting induction is based on the noetherian induction on some reduction order and the original rewriting induction is not capable of proving theorems which are not orientable by that reduction order. To deal with such theorems, Bouhoula (1995) as well as Dershowit...

Multiset orderings are a key ingredient in certain termination techniques like the recursive path ordering and a variant of size-change termination. In order to integrate these techniques in a certifier for termination proofs, we have added them to the Isabelle Formalization of Rewriting. To this end, it was required to extend the existing formalization on multiset orderings towards a generaliz...

In the first part of the talk we study functorial properties of some termination orderings following ideas from Feferman and Girard. Using a classical result which basically goes back to Ehrenfeucht we obtain some applications to the model theory of termination orderings with respect to infinitary languages. In the second part we investigate analytical properties of termination orderings with r...

“Manna” is the product obtained from solidification of elaborate sap that comes out incisions made during summer season on stem and main branches some species genus Fraxinus (Oleaceae). The cultivation manna ash trees dates back to ancient times in Sicily elsewhere – known as sacred trees, a symbol abundance therefore auspicious was increasingly widespread until middle last century. Subsequentl...