Usted se encuentra revisando un registro bibliográfico de la BDU Para conocer mas sobre la Base de Datos Unificada haga click en el ícono del home

Titulos:
Formal development of programs and proofs Edsger W. Dijkstra
Idiomas:
eng
ISBN:
0201172372
Lugar de Edición:
Editor:
Addison-Wesley,
Fecha de Edición:
1990
Notas Formateada:
Constructive type theory: a prerspective from computing science / Roland C. Backhouse -- 2: The maximum-segment-sum problem / David Gries -- 3: Inorder trasversal of a binary tree and its inversion / David Gries and Jan L. A. Van de Snepscheut -- 4: A hands-in-the-pocket presentation of a k-majority vote algorithm / David Gries -- 5: A small problem on rectangles / A. J. M. Van Gastern -- 6: On the formal derivation of a proof of the invariance theorem / A. J. M. Van Gastern -- 7: A problem on bichrome 6-graphs / A. J. M. Van Gastern -- 8: Formal progam transformations for VLSI circuits synthesis / A. J. Martin -- 9: Programs from specifications / Joseph M. Morris -- 10: Piecewise data refinement / Joseph M. Morris -- 11: Exercises in formula manipulation / W. H. J. Feijen -- 12: Multiplication and division of polynomials / Martin Rem -- 13: A paralell program that generates the Möbius sequence / Martin Rem and Tom Verhoeff -- 14:Distribution and inversion of warshall0s algorithm / A. J. M. Van Gastern -- 15: A distributed algorithm for mutual exclusion: an experiment in presentation / A. J. M. Van Gastern -- 16: The derivation of a proof by J.C.S.P. van der Woude / Edsger W. Dijkstra -- 17: Fillers at the YoP institute / Edsger W. Dijkstra -- 18: Influences (or Lack thereof) of formalism in teaching programming and software engineering / David Gries
Palabras clave:

Leader:
cam
Campo 003:
AR-BaIT
Campo 008:
270401s1990t |||||||||||||||||eng
Campo 020:
^a0201172372
Campo 040:
^aITBA^cITBA
Campo 041:
0 ^aeng
Campo 100:
1 ^aDijkstra, Edsger W.^95396
Campo 245:
10^aFormal development of programs and proofs^cEdsger W. Dijkstra
Campo 246:
Campo 260:
^bAddison-Wesley,^c1990
Campo 300:
^axiv, 242 p.
Campo 505:
0 ^aConstructive type theory: a prerspective from computing science / Roland C. Backhouse -- 2: The maximum-segment-sum problem / David Gries -- 3: Inorder trasversal of a binary tree and its inversion / David Gries and Jan L. A. Van de Snepscheut -- 4: A hands-in-the-pocket presentation of a k-majority vote algorithm / David Gries -- 5: A small problem on rectangles / A. J. M. Van Gastern -- 6: On the formal derivation of a proof of the invariance theorem / A. J. M. Van Gastern -- 7: A problem on bichrome 6-graphs / A. J. M. Van Gastern -- 8: Formal progam transformations for VLSI circuits synthesis / A. J. Martin -- 9: Programs from specifications / Joseph M. Morris -- 10: Piecewise data refinement / Joseph M. Morris -- 11: Exercises in formula manipulation / W. H. J. Feijen -- 12: Multiplication and division of polynomials / Martin Rem -- 13: A paralell program that generates the Möbius sequence / Martin Rem and Tom Verhoeff -- 14:Distribution and inversion of warshall0s algorithm / A. J. M. Van Gastern -- 15: A distributed algorithm for mutual exclusion: an experiment in presentation / A. J. M. Van Gastern -- 16: The derivation of a proof by J.C.S.P. van der Woude / Edsger W. Dijkstra -- 17: Fillers at the YoP institute / Edsger W. Dijkstra -- 18: Influences (or Lack thereof) of formalism in teaching programming and software engineering / David Gries
Proveniencia:
^aInstituto Tecnológico Buenos Aires (ITBA) - Biblioteca
Seleccionar y guardar el registro Haga click en el botón del carrito
Institucion:
Instituto Tecnológico Buenos Aires (ITBA)
Dependencia:
Biblioteca

Compartir este registro en Redes Sociales

Seleccionar y guardar el registro Haga click en el botón del carrito