Isbn: 9780521420365 - predicate transformer semantics (cambridge tracts in theoretical computer science, series number 33) (2 resultados)

ISBN: 
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (2)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Cambridge Univ Pr, West Nyack, New York, U.S.A., 1992

    0521420369 / 9780521420365

    Serie: Libro 12 de 40 - Cambridge Tracts in Theoretical Computer Science

    • Tapa dura

    Librería: Benjamin Books, Ottawa, ON, CanadaBenjamin Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Bueno

    EUR 13,84

    Envío por EUR 10,75 
    Se envía de Canada a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Condición: Very Good (+). hardcover.

  • Idioma: Inglés

    Editorial: Cambridge University Press, 1992

    0521420369 / 9780521420365

    Serie: Libro 12 de 40 - Cambridge Tracts in Theoretical Computer Science

    • Tapa dura

    Librería: Optimon Books, Gravesend, KENT, Reino UnidoOptimon Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Aceptable

    EUR 34,13

    Envío por EUR 21,31 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 1 disponible

    Hardcover. Condición: Good. A central problem in the design of programming systems is to provide methods for verifying that computer code performs to specification. This book presents a rigorous foundation for defining Boolean categories, in which the relationship between specification and behaviour can be explored. Boolean categories provide a rich interface between program constructs and techniques familiar from algebra, for instance matrix- or ideal-theoretic methods. The book's distinction is that the approach relies on only a single program construct (the first-order theory of categories), the others being derived mathematically from four axioms. Development of these axioms (which are obeyed by an abundance of program paradigms) yields Boolean algebras of 'predicates', loop-free constructs, and a calculus of partial and total correctness which is shown to be the standard one of Hoare, Dijkstra, Pratt, and Kozen. The book is based in part on courses taught by the author, and will appeal to graduate students and researchers in theoretical computer science. Copyright © Cambridge University Press.…