Invited Talks.- Software Analysis and Model Checking.- The Quest for Efficient Boolean Satisfiability Solvers.- Invited Tutorials.- On Abstraction in Software Verification.- The Symbolic Approach to Hybrid Systems.- Infinite Games and Verification.- Symbolic Model Checking.- Symbolic Localization Reduction with Reconstruction Layering and Backtracking.- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions.- Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking.- Abstraction/Refinement and Model Checking.- Liveness with (0,1, ?)- Counter Abstraction.- Shared Memory Consistency Protocol Verification Against Weak Memory Models: Refinement via Model-Checking.- Automatic Abstraction Using Generalized Model Checking.- Compositional/Structural Verification.- Property Checking via Structural Analysis.- Conformance Checking for Models of Asynchronous Message Passing Software.- A Modular Checker for Multithreaded Programs.- Timing Analysis.- Automatic Derivation of Timing Constraints by Failure Analysis.- Deciding Separation Formulas with SAT.- Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling.- SAT Based Methods.- Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT.- Applying SAT Methods in Unbounded Symbolic Model Checking.- SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques.- Semi-formal Bounded Model Checking.- Symbolic Model Checking.- Algorithmic Verification of Invalidation-Based Protocols.- Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving.- Automated Unbounded Verification of Security Protocols.- Tool Presentations.- Exploiting Behavioral Hierarchy for Efficient Model Checking.- IF-2.0: A Validation Environment for Component-Based Real-Time Systems.- The AVISS Security Protocol Analysis Tool.- SPeeDI - A Verification Tool for Polygonal Hybrid Systems.- NuSMV 2: An OpenSource Tool for Symbolic Model Checking.- The d/dt Tool for Verification of Hybrid Systems.- Infinite Model Checking.- Model Checking Linear Properties of Prefix-Recognizable Systems.- Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking.- On Discrete Modeling and Model Checking for Nonlinear Analog Systems.- Compositional/Structural Verification.- Synchronous and Bidirectional Component Interfaces.- Interface Compatibility Checking for Software Modules.- Practical Methods for Proving Program Termination.- Extended Model Checking.- Evidence-Based Model Checking.- Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification.- Vacuum Cleaning CTL Formulae.- Tool Presentations.- CVC: A Cooperating Validity Checker.- ?Chek: A Multi-valued Model-Checker.- PathFinder: A Tool for Design Exploration.- Abstracting C with abC.- AMC: An Adaptive Model Checker.- Code Verification.- Temporal-Safety Proofs for Systems Code.- Regular Model Checking and Acceleration.- Extrapolating Tree Transformations.- Regular Tree Model Checking.- Compressing Transitions for Model Checking.- Model Reduction.- Canonical Prefixes of Petri Net Unfoldings.- State Space Reduction by Proving Confluence.- Fair Simulation Minimization.
[1]
Edsger W. Dijkstra,et al.
Cooperating sequential processes
,
2002
.
[2]
Sergio Yovine,et al.
On the Decidability of the Reachability Problem for Planar Differential Inclusions
,
2001,
HSCC.
[3]
Robert P. Kurshan,et al.
Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach
,
2014
.
[4]
Sergio Yovine,et al.
Towards Computing Phase Portraits of Polygonal Differential Inclusions
,
2002,
HSCC.
[5]
Orna Kupferman,et al.
Vacuity Detection in Temporal Model Checking
,
1999,
CHARME.
[6]
Thomas A. Henzinger,et al.
HYTECH: a model checker for hybrid systems
,
1997,
International Journal on Software Tools for Technology Transfer.
[7]
藤原 秀雄,et al.
Logic testing and design for testability
,
1985
.
[8]
Kenneth L. McMillan,et al.
Symbolic model checking
,
1992
.
[9]
Pravin Varaiya,et al.
What's decidable about hybrid automata?
,
1995,
STOC '95.
[10]
Pravin Varaiya,et al.
Ellipsoidal Techniques for Reachability Analysis
,
2000,
HSCC.
[11]
Kavita Ravi,et al.
Hints to accelerate Symbolic Traversal
,
1999,
CHARME.
[12]
Gerardo Lafferriere,et al.
Symbolic Reachability Computation for Families of Linear Vector Fields
,
2001,
J. Symb. Comput..
[13]
Timothy Kam,et al.
Coverage estimation for symbolic model checking
,
1999,
DAC '99.