My Account Log in

1 option

Computer Aided Verification : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / edited by Natasha Sharygina, Helmut Veith.

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

View online
Format:
Book
Contributor:
Sharygina, Natasha, editor.
Veith, Helmut, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 8044.
Theoretical Computer Science and General Issues ; 8044
Language:
English
Subjects (All):
Computer logic.
Software engineering.
Computers, Special purpose.
Logics and Meanings of Programs.
Software Engineering.
Special Purpose and Application-Based Systems.
Local Subjects:
Logics and Meanings of Programs.
Software Engineering.
Special Purpose and Application-Based Systems.
Physical Description:
1 online resource (XXII, 1015 pages) : 237 illustrations.
Edition:
First edition 2013.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
System Details:
text file PDF
Summary:
This book constitutes the thoroughly refereed proceedings of the 25th International Conference on Computer Aided Verification, CAV 2013 held in St. Petersburg, Russia in July 2013. The 54 regular and 16 tool papers presented were carefully selected from 209 submissions. The papers are organized in topical sections on biology, concurrency, hardware, hybrid systems, interpolation, loops and termination, new domains, probability and statistics, SAT and SMZ, security, shape analysis, synthesis, and time.
Contents:
Automata Networks
Model-Checking Signal Transduction Networks through Decreasing Reachability Sets
TTP: Tool for Tumor Progression
Exploring Parameter Space of Stochastic Biochemical Systems using Quantitative Model Checking
Parameterized Verification of Asynchronous Shared-Memory Systems
Partial Orders for Efficient BMC of Concurrent Software
Incremental, Inductive Coverability
Automatic linearizability proofs of concurrent objects with cooperating
Updates
Duet: Static Analysis for Unbounded Parallelism
SVA and PSL Local Variables
A Practical Approach
Formal Verification of Hardware Synthesis
CacBDD: A BDD Package with Dynamic Cache Management
Distributed Explicit State Model Checking of Deadlock Freedom
Exponential-Condition-Based Barrier Certificate Generation for Safety
Verification of Hybrid Systems
Efficient Robust Monitoring for STL
Abstraction based Model-Checking of Stability of Hybrid Systems
Faster Algorithms for Markov Decision Processes with Low Tree width
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
Importance Splitting for Statistical Model Checking Rare Properties
Minimal Sets over Monotone Predicates in Boolean Formulae
Smten: Automatic Translation of High-level Symbolic Computations into SMT Queries
QUAIL: a quantitative security analyzer for imperative code
Effectively Propositional Reasoning about Reachability in Linked Data Structures
Learning Universally Quantified Invariants of Linear Data Structures
GOAL for Games, Omega-Automata, and Logics
Efficient synthesis for concurrency using semantics-preserving Transformations.
Other Format:
Printed edition:
ISBN:
978-3-642-39799-8
9783642397998
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