Compositional CSP traces refinement checking

DOI10.1016/J.ENTCS.2009.08.022zbMATH Open1335.68151OpenAlexW2017623530MaRDI QIDQ5178982FDOQ5178982

Authors: Daniel Wonisch, Heike Wehrheim 

Publication date: 18 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.022

Recommendations

• scientific article; zbMATH DE number 1956591
• Automated Assume-Guarantee Reasoning by Abstraction Refinement
• Automatic symbolic compositional verification by learning assumptions
• Refining Interface Alphabets for Compositional Verification
• Computer Aided Verification

zbMATH Keywords

learningCSPcompositional verificationrefinementassume-guarantee rule

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Learning regular sets from queries and counterexamples
• Title not available (Why is that?)
• Title not available (Why is that?)
• Communicating sequential processes
• Concurrency verification. Introduction to compositional and noncompositional methods
• Proofs of Networks of Processes
• 25 years of model checking. History, achievements, perspectives
• Inference of finite automata using homing sequences
• Insights to Angluin's learning
• Title not available (Why is that?)
• Using partial orders for the efficient verification of deadlock freedom and safety properties

Cited In (3)

• SAT-solving in CSP trace refinement
• Integrated Formal Methods
• Assumption-commitment support for CSP model checking

Uses Software

• FDR2

This page was built for publication: Compositional CSP traces refinement checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178982)