My Account Log in

1 option

Tools and Algorithms for the Construction and Analysis of Systems : 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings / edited by Holger Hermanns, Jens Palsberg.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Hermanns, Holger, 1967- editor.
Palsberg, Jens, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3920.
Theoretical Computer Science and General Issues ; 3920
Language:
English
Subjects (All):
Software engineering.
Computer logic.
Computer networks.
Algorithms.
Software Engineering/Programming and Operating Systems.
Logics and Meanings of Programs.
Software Engineering.
Computer Communication Networks.
Algorithm Analysis and Problem Complexity.
Local Subjects:
Software Engineering/Programming and Operating Systems.
Logics and Meanings of Programs.
Software Engineering.
Computer Communication Networks.
Algorithm Analysis and Problem Complexity.
Physical Description:
1 online resource (XVI, 512 pages).
Edition:
First edition 2006.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
System Details:
text file PDF
Summary:
ETAPS 2006 was the ninth 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 conferences. This year it comprised ?ve conferences (CC, ESOP, FASE, FOSSACS, TACAS), 18 satellite workshops (AC- CAT, AVIS, CMCS, COCV, DCC, EAAI, FESCA, FRCSS, GT-VMT, LDTA, MBT, QAPL, SC, SLAP, SPIN, TERMGRAPH, WITS and WRLA), two tutorials, and seven invited lectures (not including those that were speci?c to the satellite events). We - ceived over 550 submissions to the ?ve conferences this year, giving an overall acc- tance rate of 23%, with acceptance rates below 30% for each conference. Congratu- tions to all the authors who made it to the ?nal programme! I hope that most of the other authorsstill founda way of participatingin this excitingevent and I hope you will continue submitting. The events that comprise ETAPS address various aspects of the system devel- ment process, including speci?cation, design, implementation, analysis and impro- ment. The languages, methodologies and tools which support these activities 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 systems, and the emphasis on software is not intended to be exclusive.
Contents:
Invited Contributions
Weighted Pushdown Systems and Trust-Management Systems
Parametrization and Slicing
Automatic Verification of Parameterized Data Structures
Parameterized Verification of ?-Calculus Systems
Easy Parameterized Verification of Biphase Mark and 8N1 Protocols
Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs
Symbolic Techniques
New Metrics for Static Variable Ordering in Decision Diagrams
Widening ROBDDs with Prime Implicants
Efficient Guided Symbolic Reachability Using Reachability Expressions
Satisfiability
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver
SAT-Based Software Certification
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants
Exploration of the Capabilities of Constraint Programming for Software Verification
Abstraction
Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems
Why Waste a Perfectly Good Abstraction?
Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking
Approximating Predicate Images for Bit-Vector Logic
Model Checking Algorithms
Finitary Winning in ?-Regular Games
Efficient Model Checking for LTL with Partial Order Snapshots
A Local Shape Analysis Based on Separation Logic
Program Verification
Compositional Model Extraction for Higher-Order Concurrent Programs
A Region Graph Based Approach to Termination Proofs
Verifying Concurrent Message-Passing C Programs with Recursive Calls
Automata-Based Verification of Programs with Tree Updates
Runtime Diagnostics
An Experimental Comparison of the Effectiveness of Control Flow Based Testing Approaches on Seeded Faults
Exploiting Traces in Program Analysis
Quantitative Techniques
Model-Checking Markov Chains in the Presence of Uncertainties
Safety Metric Temporal Logic Is Fully Decidable
Simulation-Based Graph Similarity
Tool Demonstrations
PRISM: A Tool for Automatic Verification of Probabilistic Systems
DISTRIBUTOR and BCG_MERGE: Tools for Distributed Explicit State Space Generation
mcmas: A Model Checker for Multi-agent Systems
MSCan - A Tool for Analyzing MSC Specifications
Refinement
A Practical and Complete Approach to Predicate Refinement
Counterexample Driven Refinement for Abstract Interpretation
Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems.
Other Format:
Printed edition:
ISBN:
978-3-540-33057-8
9783540330578
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account