Automatic symbolic compositional verification by learning assumptions
type: Item
instance of: scholarly article
title: Automatic symbolic compositional verification by learning assumptions
zbMATH Open document ID: 1147.68052
author: Wonhong Nam
author: Parthasarathy Madhusudan
author: Rajeev Alur
published in: Formal Methods in System Design
publication date: 2008-07-30T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5306153
zbMATH Keywords: Formal verification
zbMATH Keywords: Symbolic model checking
zbMATH Keywords: Compositional verification
zbMATH Keywords: Assume-guarantee reasoning
zbMATH Keywords: Regular language learning
zbMATH Keywords: Hypergraph partitioning
describes a project that uses: LEVER
describes a project that uses: NuSMV
describes a project that uses: MOCHA
MaRDI profile type: Publication
full work available at URL: s10703-008-0055-8
OpenAlex ID: W2114114829
cites work: Q4270053
cites work: Synthesis of interface specifications for Java classes
cites work: Computer Aided Verification
cites work: Learning regular sets from queries and counterexamples
cites work: Learning deterministic finite automata from smallest counterexamples
cites work: Graph-Based Algorithms for Boolean Function Manipulation
cites work: Q4804909
cites work: Q2754081
cites work: Q4417936
cites work: Automated Assumption Generation for Compositional Verification
cites work: Learning regular languages from counterexamples
cites work: Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Q4326390
cites work: Q4804900
cites work: Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
cites work: Q2754080
cites work: Q4807832
cites work: Inference of finite automata using homing sequences
cites work: FM 2005: Formal Methods
cites work: SAT-Based Compositional Verification Using Lazy Learning
cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
DOI: 10.1007/S10703-008-0055-8
description: scientific article; zbMATH DE number 5306153