Modeling Asymptotic Complexity Using ACL2

Autor:	Young, William D.
Rok vydání:	2022
Předmět:	Computer Science - Computational Complexity Computer Science - Logic in Computer Science
Zdroj:	EPTCS 359, 2022, pp. 83-98
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.359.9
Popis:	The theory of asymptotic complexity provides an approach to characterizing the behavior of programs in terms of bounds on the number of computational steps executed or use of computational resources. We describe work using ACL2 to prove complexity properties of programs implemented in a simple imperative programming language embedding via an operational semantics in ACL2. We simultaneously prove functional properties of a program and its complexity. We illustrate our approach by describing proofs about a binary search algorithm, proving both that it implements binary search on a sorted list and that it is O(log(n)), where n is the length of the list. Comment: In Proceedings ACL2 2022, arXiv:2205.11103
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2205.11700 Zobrazit plný text záznamu View this record from Arxiv