Product Type
Condition
Binding
Collectible Attributes
Free Shipping
Seller Location
Seller Rating
Published by Springer, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Book
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.
Published by Springer, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Seller: booksXpress, Bayonne, NJ, U.S.A.
Book
Soft Cover. Condition: new.
Published by Springer, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Book
Condition: New.
Published by Springer, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Book Print on Demand
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book.
Published by Springer Berlin Heidelberg, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Seller: AHA-BUCH GmbH, Einbeck, Germany
Book
Taschenbuch. Condition: 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.
Published by Springer Berlin Heidelberg, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Seller: moluna, Greven, Germany
Book Print on Demand
Condition: 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.
Published by Springer 1991-10, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Seller: Chiron Media, Wallingford, United Kingdom
Book
PF. Condition: New.
Published by Springer Berlin Heidelberg Okt 1991, 1991
ISBN 10: 3540544771ISBN 13: 9783540544777
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Book Print on Demand
Taschenbuch. Condition: 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.