Tools and Algorithms for the Construction and Analysis of Systems: 13th International Conference, TACAS 2007 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24 - April 1, 2007 Proceedings: Lecture Notes in Computer Science, cartea 4424
Editat de Orna Grumberg, Michael Huthen Limba Engleză Paperback – 9 mar 2007
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 655.03 lei
Preț vechi: 818.79 lei
-20% Nou
Puncte Express: 983
Preț estimativ în valută:
125.36€ • 130.22$ • 104.13£
125.36€ • 130.22$ • 104.13£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540712084
ISBN-10: 3540712089
Pagini: 764
Ilustrații: XX, 740 p.
Dimensiuni: 152 x 229 x 30 mm
Greutate: 1.05 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540712089
Pagini: 764
Ilustrații: XX, 740 p.
Dimensiuni: 152 x 229 x 30 mm
Greutate: 1.05 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Contributions.- THERE AND BACK AGAIN: Lessons Learned on the Way to the Market.- Verifying Object-Oriented Software: Lessons and Challenges.- Software Verification.- Shape Analysis by Graph Decomposition.- A Reachability Predicate for Analyzing Low-Level Software.- Generating Representation Invariants of Structurally Complex Data.- Probabilistic Model Checking and Markov Chains.- Multi-objective Model Checking of Markov Decision Processes.- PReMo: An Analyzer for Probabilistic Recursive Models.- Counterexamples in Probabilistic Model Checking.- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking.- Static Analysis.- Causal Dataflow Analysis for Concurrent Programs.- Type-Dependence Analysis and Program Transformation for Symbolic Execution.- JPF–SE: A Symbolic Execution Extension to Java PathFinder.- Markov Chains and Real-Time Systems.- A Symbolic Algorithm for Optimal Markov Chain Lumping.- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations.- Model Checking Probabilistic Timed Automata with One or Two Clocks.- Adaptor Synthesis for Real-Time Components.- Timed Automata and Duration Calculus.- Deciding an Interval Logic with Accumulated Durations.- From Time Petri Nets to Timed Automata: An Untimed Approach.- Complexity in Simplicity: Flexible Agent-Based State Space Exploration.- On Sampling Abstraction of Continuous Time Logic with Durations.- Assume-Guarantee Reasoning.- Assume-Guarantee Synthesis.- Optimized L*-Based Assume-Guarantee Reasoning.- Refining Interface Alphabets for Compositional Verification.- MAVEN: Modular Aspect Verification.- Biological Systems.- Model Checking Liveness Properties of Genetic Regulatory Networks.- Checking Pedigree Consistency with PCS.- “Don’t Care” Modeling: A LogicalFramework for Developing Predictive System Models.- Abstraction Refinement.- Deciding Bit-Vector Arithmetic with Abstraction.- Abstraction Refinement of Linear Programs with Arrays.- Property-Driven Partitioning for Abstraction Refinement.- Combining Abstraction Refinement and SAT-Based Model Checking.- Message Sequence Charts.- Detecting Races in Ensembles of Message Sequence Charts.- Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning.- Automata-Based Model Checking.- Improved Algorithms for the Automata-Based Approach to Model-Checking.- GOAL: A Graphical Tool for Manipulating Büchi Automata and Temporal Formulae.- Faster Algorithms for Finitary Games.- Specification Languages.- Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs,.- motor:The modest Tool Environment.- Syntactic Optimizations for PSL Verification.- The Heterogeneous Tool Set, Hets.- Security.- Searching for Shapes in Cryptographic Protocols.- Automatic Analysis of the Security of XOR-Based Key Management Schemes.- Software and Hardware Verification.- State of the Union: Type Inference Via Craig Interpolation.- Hoare Logic for Realistically Modelled Machine Code.- VCEGAR: Verilog CounterExample Guided Abstraction Refinement.- Decision Procedures and Theorem Provers.- Alloy Analyzer+PVS in the Analysis and Verification of Alloy Specifications.- Combined Satisfiability Modulo Parametric Theories.- A Gröbner Basis Approach to CNF-Formulae Preprocessing.- Kodkod: A Relational Model Finder.- Model Checking.- Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams.- Model Checking on Trees with Path Equivalences.- Uppaal/DMC – Abstraction-Based Heuristics for Directed Model Checking.- Distributed Analysis with?CRL: A Compendium of Case Studies.- Infinite-State Systems.- A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes.- Unfolding Concurrent Well-Structured Transition Systems.- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems).