In EDS ansehen

Program verification and refactoring in answer set programming

Gespeichert in:
Bibliographische Detailangaben
Titel: Program verification and refactoring in answer set programming
Autoren: Temple, Nathan
Verlagsinformationen: The University of Texas at Austin, 2024.
Publikationsjahr: 2024
Schlagwörter: Refactoring, Safety in logic programs, Formal methods, Prime numbers, Computational domains, Local tightness, Bishops on a chessboard, Logic programming, Equivalence verification, Combinatorial problems, Program verification, Program behavior preservation, Vampire theorem prover, Composite numbers, Optimization in ASP, Declarative programming paradigm, Anthem verification tool, Two-sorted first-order logic, Answer set programming (ASP), Induction axioms
Beschreibung: This thesis addresses the verification and refactoring of programs written in Answer Set Programming (ASP), a declarative programming paradigm used for solving complex combinatorial problems. The focus is on the use of the Anthem verification tool, which translates ASP programs into a two-sorted first-order logic that can be processed by the Vampire theorem prover. The study begins by exploring the verification of safety and efficiency in logic programs. We present detailed examples, including the verification of programs for calculating prime numbers and the safe refactoring of composite number programs. We introduce methods to ensure the preservation of program behavior during refactoring, employing the Anthem-p2p tool to verify programs for solving the frame problem in artificial intelligence. We extend existing verification frameworks to locally tight programs, which may contain recursion but not infinite recursion. We provide formal definitions of local tightness and demonstrate how these definitions can be applied to verify the correctness of logic programs in broader contexts. The contributions of this thesis include new techniques for verifying the equivalence of logic programs, improvements to existing verification tools, and a comprehensive framework for ensuring program correctness in ASP. These advancements facilitate the development of reliable and efficient logic programs, enhancing the applicability of ASP in various computational domains.
Publikationsart: Thesis
Sprache: English
DOI: 10.26153/tsw/59441
Dokumentencode: edsair.doi...........8c79f05c4bf4d21d34907ba3320f0f35
Datenbank: OpenAIRE
Beschreibung
Abstract:This thesis addresses the verification and refactoring of programs written in Answer Set Programming (ASP), a declarative programming paradigm used for solving complex combinatorial problems. The focus is on the use of the Anthem verification tool, which translates ASP programs into a two-sorted first-order logic that can be processed by the Vampire theorem prover. The study begins by exploring the verification of safety and efficiency in logic programs. We present detailed examples, including the verification of programs for calculating prime numbers and the safe refactoring of composite number programs. We introduce methods to ensure the preservation of program behavior during refactoring, employing the Anthem-p2p tool to verify programs for solving the frame problem in artificial intelligence. We extend existing verification frameworks to locally tight programs, which may contain recursion but not infinite recursion. We provide formal definitions of local tightness and demonstrate how these definitions can be applied to verify the correctness of logic programs in broader contexts. The contributions of this thesis include new techniques for verifying the equivalence of logic programs, improvements to existing verification tools, and a comprehensive framework for ensuring program correctness in ASP. These advancements facilitate the development of reliable and efficient logic programs, enhancing the applicability of ASP in various computational domains.
DOI:10.26153/tsw/59441