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

Nicolas Halbwachs, Lenore Zuck (Herausgeber)

Buch | Softcover

XVIII, 590 Seiten

2005
Springer Berlin (Verlag)
978-3-540-25333-4 (ISBN)

Artikel merken

ETAPS 2005 was the eighth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conf- ences. This year it comprised ?ve conferences (CC, ESOP, FASE, FOSSACS, TACAS), 17 satellite workshops (AVIS, BYTECODE, CEES, CLASE, CMSB, COCV, FAC, FESCA, FINCO, GCW-DSE, GLPL, LDTA, QAPL, SC, SLAP, TGC, UITP), seven invited lectures (not including those that were speci?c to the satellite events), and several tutorials. We received over 550 submissions to the ?ve conferences this year, giving acceptance rates below 30% for each one. Congratulations to all the authors who made it to the ?nal program! I hope that most of the other authors still found a way of participating in this exciting event and I hope you will continue submitting. The events that comprise ETAPS address various aspects of the system - velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools which support these - tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware s- tems,andtheemphasisonsoftwareisnotintendedtobeexclusive.

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.

Erscheint lt. Verlag	23.3.2005
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	XVIII, 590 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	853 g
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
Schlagworte	Abstraction • Algorithm analysis and problem complexity • algorithms • Automata • Debugging • development tools • formal methods • Java • Logic • Model Checking • program analysis • programming • Programming Theory • Serial ATA • Simulation • Systems Analysis • Systems Design • systems Development • systems modeling • Systems Specification • systems verification
ISBN-10	3-540-25333-5 / 3540253335
ISBN-13	978-3-540-25333-4 / 9783540253334
Zustand	Neuware