Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND YEAR=1979

• On the abstract specification and formal analysis of synchronization properties of concurrent systems
  P.E. Lauer, M.W. Shields
  Lecture Notes in Computer Science 75, 1979, pp. 1-32
• On the formal specification and analysis of loosely connected processes
  E. Miller, C.K. Yap
  Lecture Notes in Computer Science 75, 1979, pp. 33-66
• Synchronized parallel computation and slowdown of translators
  K. Culik II
  Lecture Notes in Computer Science 75, 1979, pp. 67-105
• Nondeterminism, parallelism and intermittent assertions
  R. Kurki-Suonio
  Lecture Notes in Computer Science 75, 1979, pp. 106-126
• A formal specification technique for abstract data types with parallelism
  A. Yonezawa
  Lecture Notes in Computer Science 75, 1979, pp. 127-150
• Verifying parallel programs with resource allocation
  S. Owicki
  Lecture Notes in Computer Science 75, 1979, pp. 151-164
• Equivalent key problem of the relational database model
  Y. Kambayashi
  Lecture Notes in Computer Science 75, 1979, pp. 165-192
• A file organization suitable for relational database operations
  K. Tanaka, Ch. Le-Viet, Y. Kambayashi, S. Yajima
  Lecture Notes in Computer Science 75, 1979, pp. 193-227
• Specified programming
  A. Blikle
  Lecture Notes in Computer Science 75, 1979, pp. 228-251
• A calculus for proving properties of while-programs
  J. Loeckx, I. Glasner
  Lecture Notes in Computer Science 75, 1979, pp. 252-281
• ``E-correctness'' of a set of ``computation processes''
  K. Sugawara, H. Kawaguchi, T. Nishizawa
  Lecture Notes in Computer Science 75, 1979, pp. 282-301
• Program synthesis through Gödel's interpretation
  S. Goto
  Lecture Notes in Computer Science 75, 1979, pp. 302-325
• The Vienna development method (VDM): Software specification & program synthesis
  D. Björner
  Lecture Notes in Computer Science 75, 1979, pp. 326-359
• On a uniform formal description of data structures
  M. Paul, U. Güntzer
  Lecture Notes in Computer Science 75, 1979, pp. 360-383
• Extending an implementation language to a specification language
  E.R. Anderson, F.C. Belz, E.K. Blum
  Lecture Notes in Computer Science 75, 1979, pp. 384-424
• Some design principles and theory for OBJ-0, a language to express and execute algebraic specifications of programs
  J.A. Goguen
  Lecture Notes in Computer Science 75, 1979, pp. 425-473
• The specification and proof of correctness of interactive programs
  L. Lamport
  Lecture Notes in Computer Science 75, 1979, pp. 474-537
• On a theory of decision problems in programming languages
  H. Langmaack
  Lecture Notes in Computer Science 75, 1979, pp. 538-558
• A representative strong equivalence class for accessible flowchart schemes
  C.C. Elgot
  Lecture Notes in Computer Science 75, 1979, pp. 559-575
• Recursive programs as functions in a first order theory
  R. Cartwright, J. McCarthy
  Lecture Notes in Computer Science 75, 1979, pp. 576-607
• A sound and complete proof system for partial program correctness
  J.W. de Bakker
  Lecture Notes in Computer Science 74, 1979, pp. 1-12
• The problem of reachability and verification of programs
  J.M. Barzdin
  Lecture Notes in Computer Science 74, 1979, pp. 13-25
• Assertion programming
  Andrzej J. Blikle
  Lecture Notes in Computer Science 74, 1979, pp. 26-42
• Complexity classes of formal languages
  Ronald V. Book
  Lecture Notes in Computer Science 74, 1979, pp. 43-56
• Fast probabilistic algorithms
  Rūsiņs̑ Freivalds
  Lecture Notes in Computer Science 74, 1979, pp. 57-69