On Fixed Point Equations over Commutative Semirings
From MaRDI portal
Publication:3590943
DOI10.1007/978-3-540-70918-3_26zbMath1186.68307OpenAlexW2168377292MaRDI QIDQ3590943
Stefan Kiefer, Michael Luttenberger, Javier Esparza
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_26
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Semirings (16Y60)
Related Items (10)
Axiomatizing rational power series over natural numbers ⋮ Efficient Computation of Throughput Values of Context-Free Languages ⋮ Convergence of Newton's method over commutative semirings ⋮ Space-efficient scheduling of stochastically generated tasks ⋮ Newton’s Method for ω-Continuous Semirings ⋮ Unnamed Item ⋮ Derivation Tree Analysis for Accelerated Fixed-Point Computation ⋮ Tree dimension in verification of constrained Horn clauses ⋮ Derivation tree analysis for accelerated fixed-point computation ⋮ Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
This page was built for publication: On Fixed Point Equations over Commutative Semirings
