Verification of evolving software via component substitutability analysis
DOI10.1007/s10703-008-0053-xzbMath1147.68047OpenAlexW2135947211MaRDI QIDQ934712
Natasha Sharygina, Nishant Sinha, Sagar Chaki, Edmund M. Clarke
Publication date: 30 July 2008
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Verification_of_Evolving_Software_via_Component_Substitutability_Analysis/6585872
Software engineeringModel checkingAssume-guarantee reasoningAutomata learningCompositional verificationPredicate abstraction
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular sets from queries and counterexamples
- Efficient verification of sequential and concurrent C programs
- Inference of finite automata using homing sequences
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Tentative steps toward a development method for interfering programs
- Lazy abstraction
- Synthesis of interface specifications for Java classes
- Tools and Algorithms for the Construction and Analysis of Systems
- SAT-Based Compositional Verification Using Lazy Learning
- Automated Assumption Generation for Compositional Verification
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- FM 2005: Formal Methods
- Refining Interface Alphabets for Compositional Verification
- Optimized L*-Based Assume-Guarantee Reasoning
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Verification of evolving software via component substitutability analysis