Tools and Algorithms for the Construction and Analysis of Systems: Third International Workshop, TACAS'97, Enschede, The Netherlands, April 2-4, 1997, Proceedings: Lecture Notes in Computer Science, cartea 1217
Editat de Ed Brinksmaen Limba Engleză Paperback – 20 mar 1997
The book presents 20 revised full papers and 5 tool demonstrations carefully selected out of 54 submissions; also included are two extended abstracts and a full paper corresponding to invited talks. The papers are organized in topical sections on space reduction techniques, tool demonstrations, logical techniques, verification support, specification and analysis, and theorem proving, model checking and applications.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1005.39 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.19 lei
- 20% Preț: 238.01 lei
- 20% Preț: 554.98 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 782.28 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 550.29 lei
- 20% Preț: 560.32 lei
- 20% Preț: 319.32 lei
- 15% Preț: 549.86 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 548.74 lei
- 20% Preț: 172.69 lei
- 20% Preț: 611.22 lei
- 20% Preț: 970.25 lei
- 20% Preț: 552.64 lei
- 20% Preț: 315.78 lei
- 20% Preț: 315.78 lei
- 20% Preț: 722.90 lei
- 20% Preț: 722.90 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.94 lei
- 20% Preț: 552.64 lei
- Preț: 389.31 lei
- 20% Preț: 564.99 lei
- 20% Preț: 724.49 lei
- 20% Preț: 552.64 lei
- 20% Preț: 1018.35 lei
- 20% Preț: 331.82 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 322.14 lei
Preț vechi: 402.68 lei
-20% Nou
Puncte Express: 483
Preț estimativ în valută:
61.69€ • 66.72$ • 51.40£
61.69€ • 66.72$ • 51.40£
Carte tipărită la comandă
Livrare economică 11-25 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540627906
ISBN-10: 3540627901
Pagini: 452
Ilustrații: X, 437 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.63 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540627901
Pagini: 452
Ilustrații: X, 437 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.63 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Hardware and software synthesis, optimization, and verification from Esterel programs.- Manipulation algorithms for K*BMDs.- Combining partial order and symmetry reductions.- Partial model checking with ROBDDs.- Space efficient reachability analysis through use of pseudo-root states.- The reference component of PEP.- A tool to support formal reasoning about computer languages.- The term processor generator Kimwitu.- Graphs in MetaFrame: The unifying power of polymorphism.- A tableau system for linear-TIME temporal logic.- Model-checking for a subclass of event structures.- Real-time logics: Fictitious clock as an abstraction of dense time.- Mosel: A flexible toolset for monadic second-order logic.- A brief introduction to coloured Petri Nets.- Design/CPN — A computer tool for Coloured Petri Nets.- Formal verification of statecharts with instantaneous chain reactions.- Compositional state space generation from Lotos programs.- Syntactic detection of process divergence and non-local choice in message sequence charts.- An automata based verification environment for mobile processes.- Compositional performance analysis.- Incremental development of deadlock-free communicating systems.- Automatic synthesis of specifications from the dynamic observation of reactive programs.- Visual verification of reactive systems.- Theorem prover support for the refinement of stream processing functions.- Integration in PVS: Tables, types, and model checking.- Test generation for intelligent networks using model checking.- Mechanically verified self-stabilizing hierarchical algorithms.- The bounded retransmission protocol must be on time!.