Tools and Algorithms for the Construction and Analysis of Systems
Editat de C. R. Ramakrishnan, Jakob Rehofen Limba Engleză Paperback – 18 mar 2008
Preț: 333.43 lei
Preț vechi: 416.79 lei
-20% Nou
Puncte Express: 500
Preț estimativ în valută:
58.99€ • 68.83$ • 51.58£
58.99€ • 68.83$ • 51.58£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540787990
ISBN-10: 3540787992
Pagini: 540
Ilustrații: XVI, 520 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.81 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540787992
Pagini: 540
Ilustrații: XVI, 520 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.81 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talk.- Hardware Verification: Techniques, Methodology and Solutions.- Parameterized Systems.- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages.- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols.- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems.- Model Checking – I.- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking.- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking.- On-the-Fly Techniques for Game-Based Software Model Checking.- Computing Simulations over Tree Automata.- Applications.- Formal Pervasive Verification of a Paging Mechanism.- Analyzing Stripped Device-Driver Executables.- Model Checking-Based Genetic Programming with an Application to Mutual Exclusion.- Model Checking – II.- Conditional Probabilities over Probabilistic and Nondeterministic Systems.- On Automated Verification of Probabilistic Programs.- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra.- Fast Directed Model Checking Via Russian Doll Abstraction.- Static Analysis.- A SAT-Based Approach to Size Change Termination with Global Ranking Functions.- Efficient Automatic STE Refinement Using Responsibility.- Reasoning Algebraically About P-Solvable Loops.- On Local Reasoning in Verification.- Concurrent/Distributed Systems.- Interprocedural Analysis of Concurrent Programs Under a Context Bound.- Context-Bounded Analysis of Concurrent Queue Systems.- On Verifying Fault Tolerance of Distributed Protocols.- Tools – I.- The Real-Time Maude Tool.- Z3: An Efficient SMT Solver.- Computation and Visualisation of Phase Portraits for Model Checking SPDIs.- GOAL Extended: Towards a Research Tool for Omega Automata andTemporal Logic.- Symbolic Execution.- RWset: Attacking Path Explosion in Constraint-Based Test Generation.- Demand-Driven Compositional Symbolic Execution.- Peephole Partial Order Reduction.- Abstraction, Interpolation.- Efficient Interpolant Generation in Satisfiability Modulo Theories.- Quantified Invariant Generation Using an Interpolating Saturation Prover.- Accelerating Interpolation-Based Model-Checking.- Automatically Refining Abstract Interpretations.- Tools – II.- SVISS: Symbolic Verification of Symmetric Systems.- RESY: Requirement Synthesis for Compositional Model Checking.- Scoot: A Tool for the Analysis of SystemC Models.- Trust, Reputation.- Trusted Source Translation of a Total Function Language.- Rocket-Fast Proof Checking for SMT Solvers.- SDSIrep: A Reputation System Based on SDSI.