Nick Feng, Lina Marsso
, Yuliia Kholodetska and Marsha Chechik
Article (2025)
An external link is available for this item
| Department: | Department of Computer Engineering and Software Engineering |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/70416/ |
| Journal Title: | Formal Methods in System Design (vol. 67, no. 3) |
| Publisher: | Springer Science+Business Media |
| DOI: | 10.1007/s10703-025-00483-4 |
| Official URL: | https://doi.org/10.1007/s10703-025-00483-4 |
| Date Deposited: | 03 Dec 2025 12:00 |
| Last Modified: | 03 Dec 2025 12:00 |
| Cite in APA 7: | Feng, N., Marsso, L., Kholodetska, Y., & Chechik, M. (2025). Bounded satisfiability checking of FOL* formulas with aggregations. Formal Methods in System Design, 67(3), 282-315. https://doi.org/10.1007/s10703-025-00483-4 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
