Baltic Computer Science 1991

Deductive Synthesis of Programs

• Grigori Mints, Enn Tyugu:
  The Programming System PRIZ. 1-17
  
• Grigori Mints, Jan M. Smith, Enn Tyugu:
  Type-theoretical Semantics of Some Declarative Languages. 18-32
  
• Tanel Tammet:
  Using Resolution for Deciding Solvable Classes and Building Finite Models. 33-64
  
• Merik Meriste, Jaan Penjam:
  Toward Knowledge-based Specifications of Languages. 65-76
  

Inductive Synthesis of Programs

• Rusins Freivalds:
  Inductive Inference of Recursive Functions: Qualitative Theory. 77-110
  
• Rusins Freivalds, Janis Barzdins, Karlis Podnieks:
  Inductive Inference of Recursive Functions: Complexity Bounds. 111-155
  
• Alvis Brazma:
  Inductive Synthesis of Dot Expressions. 156-212
  
• Efim B. Kinber:
  Some Models of Inductive Syntactical Synthesis from Sample Computations. 213-252
  
• Guntis Barzdins:
  Inductive Synthesis of Term Rewritin Systems. 253-285
  

Automatic Test Case Generation

• Andrejs J. Auzins, Janis Barzdins, Janis Bicevskis, Karlis Cerans, Audris Kalnins:
  Automatic Construction of Test Sets: Theoretical Approach. 286-359
  
• Juris Borzovs, Audris Kalnins, Inga Medvedis:
  Automatic Construction of Test Sets: Practical Approach. 360-432
  

Specification and Verification of Distributed Systems

• Henrikas Pranevitchius:
  Aggregate Approach for Specification, Validation, Simulation and Implementation of Computer Network Protocols. 433-477
  
• Kastytis Gecas:
  A Compositional Proof System for Distributed Programs. 478-503
  
• Regimantas Pliuskevicius:
  Investigation of Finitary Calculus for a Discrete Linear Time Logic by means of Infinitary Calculus. 504-528
  

Miscellaneous

• Mikhail Auguston:
  RIGAL - a Programming Language for Compiler Writing. 529-564
  
• Rusins Freivalds:
  Complexity of Probabilistic Versus Deterministic Automata. 565-613