Three optimizations for assume-guarantee reasoning with \(L^{*}\)

DOI10.1007/s10703-007-0042-5zbMath1147.68569OpenAlexW2133521570MaRDI QIDQ934701

Sagar Chaki, Ofer Strichman

Publication date: 30 July 2008

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-007-0042-5

zbMATH Keywords

LearningSoftware verificationCompositionalityAssume-Guarantee

Mathematics Subject Classification ID

Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Compositional Reasoning

Uses Software

• PBS
• ComFoRT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning regular sets from queries and counterexamples
• Approximation algorithms for combinatorial problems
• Inference of finite automata using homing sequences
• Counterexample-guided abstraction refinement for symbolic model checking
• Synthesis of interface specifications for Java classes
• Computer Aided Verification
• Computer Aided Verification
• Computer Aided Verification

This page was built for publication: Three optimizations for assume-guarantee reasoning with \(L^{*}\)