Cover Algorithms and Their Combination
From MaRDI portal
Publication:5458397
DOI10.1007/978-3-540-78739-6_16zbMATH Open1133.68318OpenAlexW2150628379MaRDI QIDQ5458397FDOQ5458397
Sumit Gulwani, Madan Musuvathi
Publication date: 11 April 2008
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78739-6_16
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (11)
- CTL* model checking for data-aware dynamic systems with arithmetic
- Conditional congruence closure over uninterpreted and interpreted symbols
- Interpolation and Symbol Elimination
- Two simple algorithms for bin covering
- Algorithms for covering multiple barriers
- Combined covers and Beth definability
- Title not available (Why is that?)
- Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes)
- Model completeness, covers and superposition
- Angle covers: algorithms and complexity
- Combination of uniform interpolants via Beth definability
This page was built for publication: Cover Algorithms and Their Combination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458397)