Computer Aided Verification: Fourth International Workshop, CAV '92, Montreal, Canada, June 29 - July 1, 1992. Proceedings: Lecture Notes in Computer Science, cartea 663
Editat de Gregor von Bochmann, David K. Probsten Limba Engleză Paperback – 30 mar 1993
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 326.72 lei
Preț vechi: 408.40 lei
-20% Nou
Puncte Express: 490
Preț estimativ în valută:
57.82€ • 67.81$ • 50.70£
57.82€ • 67.81$ • 50.70£
Carte tipărită la comandă
Livrare economică 26 ianuarie-09 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540564966
ISBN-10: 3540564969
Pagini: 440
Ilustrații: IX, 426 p.
Dimensiuni: 155 x 233 x 23 mm
Greutate: 0.62 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540564969
Pagini: 440
Ilustrații: IX, 426 p.
Dimensiuni: 155 x 233 x 23 mm
Greutate: 0.62 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Computer-hindered verification (humans can do it too).- Modular abstractions for verifying real-time distributed systems.- Layering techniques for development of parallel systems.- Efficient local correctness checking.- Mechanical verification of concurrent systems with TLA.- Using a theorem prover for reasoning about concurrent algorithms.- Verifying a logic synthesis tool in Nuprl: A case study in software verification.- Higher-level specification and verification with BDDs.- Symbolic bisimulation minimisation.- Towards a verification technique for large synchronous circuits.- Verifying timed behavior automata with nonbinary delay constraints.- Timing verification by successive approximation.- A verification strategy for timing constrained systems.- Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits.- State space caching revisited.- Verification in process algebra of the distributed control of track vehicles—A case study.- Design verification of a microprocessor using branching time regular temporal logic.- A case study in safety-critical design.- Automatic reduction in CTL compositional model checking.- Compositional model checking for linear-time temporal logic.- Property preserving simulations.- Verification with real-time COSPAN.- Model-checking for real-time systems specified in Lotos.- Decidability of bisimulation equivalences for parallel timer processes.- A proof assistant for symbolic model-checking.- Tableau recycling.- Crocos: An integrated environment for interactive verification of SDL specifications.- Verifying general safety and liveness properties with integer programming.- Generating diagnostic information for behavioral preorders.- A verification procedure via invariant for extended communicating finite-state machines.- Efficient ?-regular language containment.- Faster model checking for the modal Mu-Calculus.