You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Fundamenta Informaticae - Volume 29, issue 3

Purchase individual online access for 1 year to this journal.

Price: EUR 410.00
ISSN 0169-2968 (P)
ISSN 1875-8681 (E)

Impact Factor 2024: 0.4

Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:


- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.

Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.

A METHODOLOGY FOR CONSTRUCTING LOGIC PROGRAMS

Authors: Alexandre, Francis | Bsaïes, Khaled

Article Type: Research Article

Abstract: A methodology for constructing definite programs is presented. This presentation consists of two parts. The first part is the writing of an initial specification in Horn clauses form. In this part some paradigms of construction are outlined. The specification obtained is moded and typed; moreover it has some important specific qualities: structure, clearness, correctness and executability. However the initial specification is generally not efficient. For this reason the second part of the presentation is the stage of transformation. In this part some strategies based on folding, unfolding and generation of schemata are presented.

Keywords: logic programs, transformation, correctness, mode input-output, type, static analysis, strategy, definite program, folding, unfolding, property

DOI: 10.3233/FI-1997-29301

Citation: Fundamenta Informaticae, vol. 29, no. 3, pp. 203-223, 1997

Price: EUR 27.50

HOW TO INTERPRET AND ESTABLISH CONSISTENCY RESULTS FOR SEMANTICS OF CONCURRENT PROGRAMMING LANGUAGES

Authors: Baier, Christel | Majster-Cederbaum, Mila

Article Type: Research Article

Abstract: It is meaningful that a language is provided with several semantic descriptions: e.g. one which serves the needs of the implementor, another one that is suitable for specification and yet another one that will be used to explain the language to the user. In this case one has to guarantee that the various semantics are ‘consistent’. The attempt of this paper is to clarify the notion ‘consistency’ and to present a general framework and theorems for consistency results.

DOI: 10.3233/FI-1997-29302

Citation: Fundamenta Informaticae, vol. 29, no. 3, pp. 225-256, 1997

Price: EUR 27.50

A COMPILER CORRECTNESS PROOF FOR THE STATIC LINK TECHNIQUE BY MEANS OF EVOLVING ALGEBRAS

Authors: Mohnen, Markus

Article Type: Research Article

Abstract: The well-known static link technique is used for stack-based implementations of imperative programming languages which admit nested recursive procedure declarations. Its basic idea is to access non-local variables by tracing a static link chain to lower stack elements. Evolving algebras are a new method for defining operational semantics of abstract machines. Based on an appropriate stack machine, defined as an evolving algebra, and a functional description of a compiler for a sample language, we give a complete proof of correctness for this technique using the method of refinement.

DOI: 10.3233/FI-1997-29303

Citation: Fundamenta Informaticae, vol. 29, no. 3, pp. 257-303, 1997

Price: EUR 27.50
Show more