Abstract
Identifying a minimal unsatisfiable core in an Alloy model proved to be a very useful feature in many scenarios. We extend this concept to hot core, an approximation to unsat core that enables the user to obtain valuable feedback when the Alloy's sat-solving process is abruptly interrupted. We present some use cases that exemplify this new feature and explain the applied heuristics. The NP-completeness nature of the verification problem makes hot core specially appealing, since it is quite frequent for users of the Alloy Analyzer to stop the analysis when some time threshold is exceeded. We provide experimental results showing very promising outcomes supporting our proposal. © 2010 Springer.
Cite
CITATION STYLE
D’Ippolito, N., Frias, M. F., Galeotti, J. P., Lanzarotti, E., & Mera, S. (2010). Alloy+HotCore: A fast approximation to unsat core. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5977 LNCS, pp. 160–173). https://doi.org/10.1007/978-3-642-11811-1_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
