Abstract
AbstractLinear temporal logic (LTL) is widely used in industrial verification. LTL formulae can be learned from traces. Scaling LTL formula learning is an open problem. We implement the first GPU-based LTL learner using a novel form of enumerative program synthesis. The learner is sound and complete. Our benchmarks indicate that it handles traces at least 2048 times more numerous, and on average at least 46 times faster than existing state-of-the-art learners. This is achieved with, among others, a branch-free implementation of LTL that has $$O(\log n)$$
O
(
log
n
)
time complexity, where n is trace length, while previous implementations are $$O(n^2)$$
O
(
n
2
)
or worse (assuming bitwise boolean operations and shifts by powers of 2 have unit costs—a realistic assumption on modern processors).
Publisher
Springer Nature Switzerland
Reference36 articles.
1. Github repository. https://github.com/MojtabaValizadeh/ltl-learning-on-gpus (2024)
2. Ammons, G., Bodík, R., Larus, J.R.: Mining specifications. In: Proceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 4–16. POPL ’02, Association for Computing Machinery, New York, NY, USA (2002). https://doi.org/10.1145/503272.503275
3. Anderson, S.E.: Bit twiddling hacks: round up to the next highest power of 2 (2005). https://graphics.stanford.edu/~seander/bithacks.html
4. Arif, M.F., Larraz, D., Echeverria, M., Reynolds, A., Chowdhury, O., Tinelli, C.: SYSLITE: syntax-guided synthesis of PLTL formulas from finite traces. In: Proceedings of the International Conference on Formal Methods in Computer Aided Design, FMCAD, pp. 93–103 (2020). https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_16
5. Camacho, A., McIlraith, S.A.: Learning interpretable models expressed in linear temporal logic. In: Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS 2019, Berkeley, CA, USA, July 11-15, 2019, pp. 621–630. AAAI Press (2019). https://ojs.aaai.org/index.php/ICAPS/article/view/3529