Tipo de artículo
Condición
Encuadernación
Más atributos
Ubicación del vendedor
Valoración de los vendedores
Publicado por Springer, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
Libro
Paperback. Condición: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
Publicado por Springer, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Librería: booksXpress, Bayonne, NJ, Estados Unidos de America
Libro
Soft Cover. Condición: new.
Publicado por Springer, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Libro
Condición: New.
Publicado por Springer, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Libro Impresión bajo demanda
Condición: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Publicado por Springer Berlin Heidelberg, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Libro
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the proceedings of the second workshopon Computer Aided Verification, held at DIMACS, RutgersUniversity, June 18-21, 1990. Itfeatures theoreticalresults that lead to new or more powerful verificationmethods. Among these are advances in the use of binarydecision diagrams, dense time, reductions based upon partialorder representations and proof-checking in controllerverification. The motivation for holding a workshop oncomputer aided verification was to bring together work oneffective algorithms or methodologies for formalverification - as distinguished, say,from attributes oflogics or formal languages. The considerable interestgenerated by the first workshop, held in Grenoble, June 1989(see LNCS 407), prompted this second meeting. The generalfocus of this volume is on the problem of making formalverification feasible for various models of computation.Specific emphasis is on models associated with distributedprograms, protocols, and digital circuits. The general testof algorithm feasibility is to embed it into a verificationtool, and exercise that tool on realistic examples: theworkshop included sessionsfor the demonstration of newverification tools.
Publicado por Springer Berlin Heidelberg, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Librería: moluna, Greven, Alemania
Libro Impresión bajo demanda
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This volume contains the proceedings of the second workshopon Computer Aided Verification, held at DIMACS, RutgersUniversity, June 18-21, 1990. Itfeatures theoreticalresults that lead to new or more powerful verificationmethods. Among these.
Publicado por Springer 1991-10, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Librería: Chiron Media, Wallingford, Reino Unido
Libro
PF. Condición: New.
Publicado por Springer Berlin Heidelberg Okt 1991, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Libro Impresión bajo demanda
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume contains the proceedings of the second workshopon Computer Aided Verification, held at DIMACS, RutgersUniversity, June 18-21, 1990. Itfeatures theoreticalresults that lead to new or more powerful verificationmethods. Among these are advances in the use of binarydecision diagrams, dense time, reductions based upon partialorder representations and proof-checking in controllerverification. The motivation for holding a workshop oncomputer aided verification was to bring together work oneffective algorithms or methodologies for formalverification - as distinguished, say,from attributes oflogics or formal languages. The considerable interestgenerated by the first workshop, held in Grenoble, June 1989(see LNCS 407), prompted this second meeting. The generalfocus of this volume is on the problem of making formalverification feasible for various models of computation.Specific emphasis is on models associated with distributedprograms, protocols, and digital circuits. The general testof algorithm feasibility is to embed it into a verificationtool, and exercise that tool on realistic examples: theworkshop included sessionsfor the demonstration of newverification tools. 392 pp. Englisch.