Abstract
AbstractWe apply and evaluate polynomial-time algorithms to compute two different normal forms of propositional formulas arising in verification. One of the normal form algorithms is presented for the first time. The algorithms compute normal forms and solve the word problem for two different subtheories of Boolean algebra: orthocomplemented bisemilattice (OCBSL) and ortholattice (OL). Equality of normal forms decides the word problem and is a sufficient (but not necessary) check for equivalence of propositional formulas. Our first contribution is a quadratic-time OL normal form algorithm, which induces a coarser equivalence than the OCBSL normal form and is thus a more precise approximation of propositional equivalence. The algorithm is efficient even when the input formula is represented as a directed acyclic graph. Our second contribution is the evaluation of OCBSL and OL normal forms as part of a verification condition cache of the Stainless verifier for Scala. The results show that both normalization algorithms substantially increase the cache hit ratio and improve the ability to prove verification conditions by simplification alone. To gain further insights, we also compare the algorithms on hardware circuit benchmarks, showing that normalization reduces circuit size and works well in the presence of sharing.
Publisher
Springer Nature Switzerland
Reference45 articles.
1. Amarù, L., Gaillardon, P.E., De Micheli, G.: The EPFL combinational benchmark suite. In: Proceedings of the 24th International Workshop on Logic & Synthesis (IWLS) (2015). https://github.com/lsils/benchmarks
2. Lecture Notes in Computer Science;H Barbosa,2022
3. Beran, L.: Orthomodular Lattices (An Algebraic Approach). Springer, Dordrecht (1985). https://doi.org/10.1007/978-94-009-5215-7
4. Birkhoff, G.: Lattice Theory, AMS Colloquium Publications, 3rd edn., vol. 25. AMS (1973)
5. Bonzio, S., Chajda, I.: A note on orthomodular lattices. Int. J. Theor. Phys. 56, 3740–3743 (2017). https://doi.org/10.1007/s10773-016-3258-6
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Interpolation and Quantifiers in Ortholattices;Lecture Notes in Computer Science;2023-12-30