I describe the challenges involved in designing and evaluating high assurance, verifiable voting systems. I describe the Pret a Voter scheme that provides voterverifiablity with minimal trust in officials, software etc. I also describe a number of threats against voting schemes and the extent to which they apply to the basic Pret a Voter scheme. Some enhancements to the scheme designed to count...

This art icle presents some ideas from parsing Context-Sensit ive languages. Introduces Scattered-Context grammars and languages and describes usage of such grammars to parse CS languages. Also there are presented additional results fronr type checking and formal prograrn verification using CS parsing. I{eywords: Turing Machines, Parsing of Context-Sensitive Languages, Fornral Program Verificat...

Smart devices have pervaded our society and encouraged lifestyles that depend on them. One of the fundamental requirements for a successful dependency is that the general public be aware of the energy limitations of these devices and to stay in control of energy consumption. In this paper, the authors propose a formal specification method that takes energy into account. They propose two develop...

AbstracL Features are application and viewer-dependent interpretations of geometry. This article demonstrates how the notion of features arising out of geometric data may be formalised as the semantics of a language of shape, using machining operations as an extended example. The syntax and semantics of formal languages are discussed, with particular reference to their use in design. A simplifi...

We extend the DSV method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.

This paper discusses scattered context grammars (SCG) and considers the application of scattered context grammar production rules. We use function that represents single derivation step over the given sentential form. Moreover, we define this function in such a way, so that it represents the delayed execution of scattered context grammar production rules using the same principles as a lazy eval...

One aspect of implicit, contextual information is its temporal component. Explicating this component in a formal model makes it possible to disambiguate some context-dependent expressions and discover connections between expressions. We have implemented and extended Allen’s algebra of temporal intervals in a reasoner that takes into account the linear nature of time and the granularity of tempo...

We generalize the word problem for groups, the formal language of all words in the generators that represent the identity, to inverse monoids. In particular, we introduce the idempotent problem, the formal language of all words representing idempotents, and investigate how the properties of an inverse monoid aer related to the formal language properties of its idempotent problem. In particular,...

Our aim in this paper is to prove geometric characterizations of the free disposal condition for nonconvex economies on infinite dimensional commodity spaces even if the cone and the production set involved in the condition have an empty interior such as in L1 with the positive cone L+. We then use this characterization to prove the existence of Pareto and weak Pareto optimal points. We also ex...