[2009.10881v1] Local Higher-Order Fixpoint Iteration
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:2009.10881v1 (cs)
[Submitted on 23 Sep 2020]

Title:Local Higher-Order Fixpoint Iteration

Authors:Florian Bruse (University of Kassel), Jörg Kreiker (University of Applied Sciences, Fulda), Martin Lange (University of Kassel), Marco Sälzer (University of Kassel)
View PDF
Abstract:Local fixpoint iteration describes a technique that restricts fixpoint iteration in function spaces to needed arguments only. It has been studied well for first-order functions in abstract interpretation and also in model checking. Here we consider the problem for least and greatest fixpoints of arbitrary type order. We define an abstract algebra of simply typed higher-order functions with fixpoints that can express fixpoint evaluation problems as they occur routinely in various applications, including program verification. We present an algorithm that realises local fixpoint iteration for such higher-order fixpoints, prove its correctness and study its optimisation potential in the context of several applications.
Comments: In Proceedings GandALF 2020, arXiv:2009.09360
Subjects: Logic in Computer Science (cs.LO)
Cite as: arXiv:2009.10881 [cs.LO]
  (or arXiv:2009.10881v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.2009.10881
Journal reference: EPTCS 326, 2020, pp. 97-113
Related DOI: https://doi.org/10.4204/EPTCS.326.7

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Wed, 23 Sep 2020 01:25:28 UTC (37 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2020-09
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)