Cantitate/Preț
Produs

Mathematical Studies of Information Processing: Proceedings of the International Conference, Kyoto, Japan, August 23-26, 1978: Lecture Notes in Computer Science, cartea 75

Editat de E.K. Blum, M. Paul, S. Takasu
en Limba Engleză Paperback – sep 1979

Din seria Lecture Notes in Computer Science

Preț: 64939 lei

Preț vechi: 81174 lei
-20% Nou

Puncte Express: 974

Preț estimativ în valută:
12428 12909$ 10323£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540095415
ISBN-10: 3540095411
Pagini: 644
Ilustrații: X, 634 p.
Dimensiuni: 155 x 233 x 34 mm
Greutate: 0.89 kg
Ediția:1979
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

On the abstract specification and formal analysis of synchronization properties of concurrent systems.- On the formal specification and analysis of loosely connected processes.- Synchronized parallel computation and slowdown of translators.- Nondeterminism, parallelism and intermittent assertions.- A formal specification technique for abstract data types with parallelism.- Verifying parallel programs with resource allocation.- Equivalent key problem of the relational database model.- A file organization suitable for relational database operations.- Specified programming.- A calculus for proving properties of while-programs.- "E-correctness" of a set of "computation processes".- Program synthesis through Gödel's interpretation.- The vienna development method (VDM).- On a uniform formal description of data structures.- Extending an implementation language to a specification language.- Some design principles and theory for OBJ-0, a language to express and execute algebraic specifications of programs.- The specification and proof of correctness of interactive programs.- On a theory of decision problems in programming languages.- A representative strong equivalence class for accessible flowchart schemes.- Recursive programs as functions in a first order theory.