Three optimizations for assume-guarantee reasoning with \(L^{*}\)
From MaRDI portal
Publication:934701
DOI10.1007/s10703-007-0042-5zbMath1147.68569MaRDI QIDQ934701
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
68Q32: Computational learning theory
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Uses Software
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item