Perspectives of System Informatics

1. Front Matter

   Pages I-XIII

   PDF

2. Memorial Session

   1. A.P. Ershov— A Pioneer and a Leader of National Programming

      • Igor V. Pottosin

      Pages 1-7

   2. A.A. Lyapunov and A.P. Ershov in the Theory of Program Schemes and the Development of Its Logic Concepts

      • Rimma I. Podlovchenko

      Pages 8-23

3. Computing and Algorithms

   1. The Abstract State Machine Paradigm: What Is in and What Is out

      • Yuri Gurevich

      Pages 24-24

   2. On Algorithmic Unsolvability

      • Svyatoslav S. Lavrov

      Pages 25-32

4. Logical Methods

   1. Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially

      • Jan Friso Groote, Hans Zantema

      Pages 33-38

   2. On Expressive and Model Checking Power of Propositional Program Logics

      • Nikolai V. Shilov, Kwang Yi

      Pages 39-46

   3. An Extension of Dynamic Logic for Modelling OCL’s @pre Operator

      • Thomas Baar, Bernhard Beckert, Peter H. Schmitt

      Pages 47-54

   4. Optimal Algorithms of Event-Driven Re-evaluation of Boolean Functions

      • Valeriy Vyatkin

      Pages 55-63

5. Verification

   1. A Transformation of SDL Specifications— A Step towards the Verification

      • Natalia Ioustinova, Natalia Sidorova

      Pages 64-78

   2. Accurate Widenings and Boundedness Properties of Timed Systems

      • Supratik Mukhopadhyay, Andreas Podelski

      Pages 79-94

   3. Adaptive Saturation-Based Reasoning

      • Alexandre Riazanov, Andrei Voronkov

      Pages 95-108

   4. A Verification Approach for Distributed Abstract State Machines

      • Robert Eschbach

      Pages 109-115

6. Program Transformation and Synthesis

   1. Transformational Construction of Correct Pointer Algorithms

      • Thorsten Ehm

      Pages 116-130

   2. A Theoretical Foundation of Program Synthesis by Equivalent Transformation

      • Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi

      Pages 131-139

   3. Equivalent Transformation by Safe Extension of Data Structures

      • Kiyoshi Akama, Hidekatsu Koike, Hiroshi Mabuchi

      Pages 140-148

   4. Semantics and Transformations in Formal Synthesis at System Level

      • Viktor Sabelfeld, Christian Blumenröhr, Kai Kapp

      Pages 149-156

   5. Automated Program Synthesis for Java Programming Language

      • Mait Harf, Kristiina Kindel, Vahur Kotkas, Peep Küngas, Enn Tyugu

      Pages 157-164

7. Semantics & Types

   1. The Varieties of Programming Language Semantics And Their Uses

      • Peter D. Mosses

      Pages 165-190

   2. Binding-Time Analysis for Polymorphic Types

      • Rogardt Heldal, John Hughes

      Pages 191-204

This book constitutes the thoroughly refereed post-proceedings of the 4th International Andrei Ershov Memorial Conference, PSI 2001, held in Akademgorodok, Novosibirsk, Russia, in July 2001.
The 50 revised papers presented together with 2 invited memorial papers devoted to the work of Andrei Ershov were carefully selected during 2 rounds of reviewing and improvement. The book offers topical sections on computing and algorithms, logical methods, verification, program transformation and synthesis, semantics and types, processes and concurrency, UML specification, Petri nets, testing, software construction, data and knowledge bases, logic programming, constraint programming, program analysis, and language implementation.

• Algorithms
• Constraint
• Unified Modeling Language (UML)
• algorithm
• logic
• petri net
• programming
• semantics
• verification

• Informatics and Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark

  Dines Bjørner

• Computer Science Department, Technical University of Munich, Munich, Germany

  Manfred Broy

• A.P.Ershov Institute of Informatics Systems, Novosibirsk, Russia

  Alexandre V. Zamulin

Policies and ethics