Efficient computation of nested fix-points, with applications to model checking

DOI10.1007/BFB0013987MaRDI QIDQ4518422zbMATH OpenFDO

Authors B. Vergauwen, Jeremy Lewi, I. Avau, A. Poté

Publication date 28 November 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0013987

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An improved algorithm for the evaluation of fixpoint expressions
• Fast and simple nested fixpoints
• Parallel and symbolic model checking for fixpoint logic with chop
• Quasipolynomial computation of nested fixpoints
• Computable fixpoints in well-structured symbolic model checking

Cited in

(9)

• Fast and simple nested fixpoints
• Quasipolynomial computation of nested fixpoints
• Computable fixpoints in well-structured symbolic model checking
• scientific article; zbMATH DE number 5173454 (Why is no real title available?)
• A distributed fixed-point algorithm for extended dependency graphs
• N-PAT: A Nested Model-Checker
• On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
• scientific article; zbMATH DE number 7333237 (Why is no real title available?)
• Programming Languages and Systems

This page was built for publication: Efficient computation of nested fix-points, with applications to model checking

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