Contents of Fundamenta Informaticae
Volume 29.
Number
1-2, January 1997- Number
3, February 1997
- Number
4, March 1997
Contents of Volume 29,
Number 1-2, January 1997
Click on title for abstract
- On Using Semi-Dyck Sets to Analyse
Coupled-Context-Free Languages
- G. HOTZ and G. PITSCH
- Semantics of Timed Concurrent
Systems
- P. DEMBINSKI
- Discrete Time Process Algebra:
Absolute Time, Relative Time and Parametric Time
- J. C. M. BAETEN and J. A. BERGSTRA
- Syntax and Semantics of Real Time
and Performance Evaluation Extensions of Specification Language LOTOS
- Z. HUZAR and J. MAGOTT
- Quasi-metrics and the Semantics
of Logic Programs
- A. K. SEDA
- Algebraic Aspects of Attribute
Dependencies in Information Systems
- I. DUNTSCH and G. GEDIGA
- Mechanization of Real-Time Linear
CSP with Higher Order Logic
- J. F. PETERS, III
- On Definitional Transformations
to Normal Form for Intuitionististic Logic
- U. EGLY
Contents of Volume
29, Number 3, February 1997
Click on title for abstract
- A Methodology for Constructing
Logic Programs
- F. ALEXANDRE and K. BSAIES
- How to Interpret and Establish
Consistency Results for Semantics of Concurrent Progarmming Languages
- C. BAIER and M. MAJSTER-CEDERBAUM
- A Compiler Correctness Proof
for the Static Link Technique by means of Evolving Algebras
- M. MOHNEN
-
Contents of Volume
29, Number 4, March 1997
- Click on title for abstract
- Semantics of Nonsequential Tree-Based
Computation Schemes
- A. EHRENFEUCHT, G. ROZENBERG and A. SALOMAA
- Chomsky Hierarchy and Systolic
Y-Tree Automata
- E. FACHINI and A. MONTI
- Atomicity and Concurrency Control
in Process Calculi
- G.-L. FERRARI
- A Representation of Dependence
Spaces and Some Basic Algorithms
- J. JARVINEN
- A New Method of Circumscribing
Beliefs: The Propositional Case
- S. KUNDU and J. CHEN