Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conference on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3440
Editat de Nicolas Halbwachs, Lenore Zucken Limba Engleză Paperback – 23 mar 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 636.11 lei
Preț vechi: 795.14 lei
-20% Nou
Puncte Express: 954
Preț estimativ în valută:
121.74€ • 128.43$ • 101.46£
121.74€ • 128.43$ • 101.46£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540253334
ISBN-10: 3540253335
Pagini: 612
Ilustrații: XVIII, 590 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.85 kg
Ediția:2005
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: 3540253335
Pagini: 612
Ilustrații: XVIII, 590 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.85 kg
Ediția:2005
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 Paper.- Applications of Craig Interpolants in Model Checking.- Regular Model-Checking.- Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking.- Simulation-Based Iteration of Tree Transducers.- Using Language Inference to Verify Omega-Regular Properties.- Infinite State Systems.- On-the-Fly Reachability and Cycle Detection for Recursive State Machines.- Empirically Efficient Verification for a Class of Infinite-State Systems.- Context-Bounded Model Checking of Concurrent Software.- A Generic Theorem Prover of CSP Refinement.- Abstract Interpretation.- Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems.- An Abstract Interpretation-Based Refinement Algorithm for Strong Preservation.- Dependent Types for Program Understanding.- Automata and Logics.- A Note on On-the-Fly Verification Algorithms.- Truly On-the-Fly LTL Model Checking.- Complementation Constructions for Nondeterministic Automata on Infinite Words.- Using BDDs to Decide CTL.- Probabilistic Systems, Probabilistic Model-Checking.- Model Checking Infinite-State Markov Chains.- Algorithmic Verification of Recursive Probabilistic State Machines.- Monte Carlo Model Checking.- Satisfiability.- Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit.- Bounded Validity Checking of Interval Duration Logic.- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic.- A Two-Tier Technique for Supporting Quantifiers in a Lazily Proof-Explicating Theorem Prover.- Testing.- Symbolic Test Selection Based on Approximate Analysis.- Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution.- Abstraction and Reduction.- Dynamic Symmetry Reduction.- Localization and Register Sharing for Predicate Abstraction.- On Some Transformation Invariants Under Retiming and Resynthesis.- Specification, Program Synthesis.- Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs.- Temporal Logic for Scenario-Based Specifications.- Mining Temporal Specifications for Error Detection.- A New Algorithm for Strategy Synthesis in LTL Games.- Model-Checking.- Shortest Counterexamples for Symbolic Model Checking of LTL with Past.- Snapshot Verification.- Time-Efficient Model Checking with Magnetic Disk.- Tool Presentations.- jMoped: A Java Bytecode Checker Based on Moped.- Java-MOP: A Monitoring Oriented Programming Environment for Java.- JML-Testing-Tools: A Symbolic Animator for JML Specifications Using CLP.- jETI: A Tool for Remote Tool Integration.- FocusCheck: A Tool for Model Checking and Debugging Sequential C Programs.- SATABS: SAT-Based Predicate Abstraction for ANSI-C.- DiVer: SAT-Based Model Checking Platform for Verifying Large Scale Systems.- BISIMULATOR: A Modular Tool for On-the-Fly Equivalence Checking.