In this paper we develop a formal model of aspects of the Forth programming language. We describe the operation of the Forth compiler as it translates Forth control words, dealing in particular with the interpretation of immediate words during compilation. Our goal here is to provide a basis for the study of safety properties of embedded systems, many of which are constructed using Forth or For...

In this paper we develop a formal specification of aspects of the Forth programming language. We describe the operation of the Forth compiler as it translates Forth control words, dealing in particular with the interpretation of immediate words during compilation. Our goal here is to provide a basis for the study of safety properties of embedded systems, many of which are constructed using Fort...

In formal concept analysis, it is well-known that the number of concepts can be exponential in worst case. To analyze average case, we introduce a probabilistic model for random contexts and prove has superpolynomial asymptotic lower bound.

This paper is devoted to a recently running project descript ion with a purpose to get some necessary feedback from the AmI community as to the project ambitions. The project intends to study possibilities of several formal approaches towards modeling intelligent environments based on principles of ambient intelligence. The main goal is in contributing towards theoretical foundations of ambient...

Cryptographic protocols are designed to provide security services, such as key distribution, authentication and non-repudiation, over insecure networks. The design process of cryptographic protocols is highly complex. In particular, the translation from the informal protocol description to the formal protocol specification is an error-prone step, as the exact meaning of the requirements of the ...

This paper conjectures a computational account of how children might learn the meanings of words in their native language First a simpli ed version of the lexical acquisition task faced by children is mod eled by a precisely speci ed formal problem Then an implemented algorithm for solving this formal prob lem is presented Key advances of this algorithm over previously proposed algorithms are i...

This paper is a survey on logical aspects of nite automata Central points are the connection between nite automata and monadic second order logic the Ehrenfeucht Fra ss e technique in the context of formal language theory nite automata on words and their determinization and a self contained proof of the Rabin Tree Theorem Sections and contain material presented in a lecture series to the Final ...

Ontology is the explicit representation of domain concept model. It can well express the complicated relationships between objects. Since formal ontology is the foundation of domain knowledge sharing and reusing, the formal ontology and associated concepts are stated in this paper. Previously research on ontology construction is high-cost and time-consuming, a new method of building ontology us...

SubC is a study imperative language around which we build the SOSSubC system as an attempt to help the development of certified programs. It allows formal reasoning about imperative programs by translating programs into equations, with which proofs can be carried out. In this paper, we add to the SubC language two important imperative features: mutable lists and call-by-reference passing mode. ...