2012/07/30 by Lee Naish · 1 citation
Computer Science · #Abstract interpretation #Answer set programming #Computer science #Computer security #Deadlock #Debugging #Formal Methods in Verification #Key (lock) #Logic program #Logic programming #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Program analysis #Programming language #Set (abstract data type) #Software engineering #Transformation (genetics) #cs.PL
paper · pdf · doi:10.1017/s147106841200035x
published as Theory and Practice of Logic Programming 14 (2014) 215-238 · Number of pages: 24 Number of figures: 9 Number of tables: none
arxiv created 2012/07/30 · openalex publication_date 2012/10/30 · arxiv updated 2020/02/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Abstract We show how logic programs with “delays” can be transformed to programs without delays in a way that preserves information concerning floundering (also known as deadlock). This allows a declarative (model-theoretic), bottom-up or goal-independent approach to be used for analysis and debugging of properties related to floundering. We rely on some previously introduced restrictions on delay primitives and a key observation which allows properties such as groundness to be analysed by approximating the (ground) success set.