€95.19
Cuprins
Invited Talks.- Embedded Systems Design — Scientific Challenges and Work Directions.- Antichain Algorithms for Finite Automata.- Probabilistic Systems and Optimization.- Assume-Guarantee Verification for Probabilistic Systems.- Simple O(m logn) Time Markov Chain Lumping.- Model Checking Interactive Markov Chains.- Approximating the Pareto Front of Multi-criteria Optimization Problems.- Decision Procedures.- An Alternative to SAT-Based Approaches for Bit-Vectors.- Satisfiability Modulo the Theory of Costs: Foundations and Applications.- Optimal Tableau Algorithms for Coalgebraic Logics.- Blocked Clause Elimination.- Tools I.- Boom: Taking Boolean Program Model Checking One Step Further.- The Open SMT Solver.- Stranger: An Automata-Based String Analysis Tool for PHP.- Automata Theory.- When Simulation Meets Antichains.- On Weak Modal Compatibility, Refinement, and the MIO Workbench.- Rational Synthesis.- Efficient Büchi Universality Checking.- Liveness.- Automated Termination Analysis for Programs with Second-Order Recursion.- Ranking Function Synthesis for Bit-Vector Relations.- Fairness for Dynamic Control.- Tools II.- JTor X: A Tool for On-Line Model-Driven Test Derivation and Execution.- SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems.- Tracking Heaps That Hop with Heap-Hop.- Software Verification.- Automatic Analysis of Scratch-Pad Memory Code for Heterogeneous Multicore Processors.- Simplifying Linearizability Proofs with Reduction and Abstraction.- A Polymorphic Intermediate Verification Language: Design and Logical Encoding.- Trace-Based Symbolic Analysis for Atomicity Violations.- Tools III.- ACS: Automatic Converter Synthesis for So C Bus Protocols.- Al Pi NA: An Algebraic Petri Net Analyzer.- PASS: Abstraction Refinement for Infinite Probabilistic Models.- Real Time and Information Flow.- Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions.- Computing the Leakage of Information-Hiding Systems.- Statistical Measurement of Information Leakage.- SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata.- Testing.- Preemption Sealing for Efficient Concurrency Testing.- Code Mutation in Verification and Automatic Code Correction.- Efficient Detection of Errors in Java Components Using Random Environment and Restarts.Cumpărați această carte electronică și primiți încă 1 GRATUIT!
Limba Engleză ● Format PDF ● Pagini 468 ● ISBN 9783642120022 ● Editor Javier Esparza & Rupak Majumdar ● Editura Springer Berlin ● Oraș Heidelberg ● Țară DE ● Publicat 2010 ● Descărcabil 24 luni ● Valută EUR ● ID 2171735 ● Protecție împotriva copiilor Adobe DRM
Necesită un cititor de ebook capabil de DRM
Mai multe cărți electronice de la același autor (i) / Editor
16.523 Ebooks din această categorie
