Least solutions of equations over N

DOI10.1007/3-540-58201-0_85MaRDI QIDQ4632443zbMATH OpenOpenAlexFDO

Authors Helmut Seidl

Publication date 29 April 2019

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58201-0_85

zbMATH Keywords

abstract interpretationascending chain conditioncomplete partial orderrandom access machinetree automaton

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 6146470
• Least and greatest solutions of equations over sets of integers
• Least and greatest solutions of equations over sets of integers
• scientific article; zbMATH DE number 5906488
• Systems of equations in inductive sets

Cites work

• Abstract interpretation and application to logic programs
• Bounded Fixed-Point Iteration
• Fibonacci heaps and their uses in improved network optimization algorithms
• Fixed points and frontiers: a new perspective
• scientific article; zbMATH DE number 3735091 (Why is no real title available?)
• scientific article; zbMATH DE number 965 (Why is no real title available?)
• Monadic second-order evaluations on tree-decomposable graphs
• Properties of data flow frameworks: A unified model

Cited in

(4)

• A faster solver for general systems of equations
• The quotient in preorder theories
• An even faster solver for general systems of equations
• Precise Fixpoint Computation Through Strategy Iteration

This page was built for publication: Least solutions of equations over N

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632443)