Finding recurrent sets with backward analysis and trace partitioning

DOI10.1007/978-3-662-49674-9_2MaRDI QIDQ2272913zbMATHOpenAlexFDO

Authors Alexey Bakhirkin, Nir Piterman

Publication date 17 September 2019

Full work available at URL https://link.springer.com/chapter/10.1007/978-3-662-49674-9_2

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Multiple Recurrence and Finding Patterns in Dense Sets
• scientific article; zbMATH DE number 2064056
• Publication:4333077
• Amortized Analysis of Algorithms for Set Union with Backtracking
• Block recursive parallelotopic bounding in set membership identification
• scientific article; zbMATH DE number 1305516
• Recounting relations for set partitions with restrictions.
• Toward the concept of backtracking computation
• A note on recurrent sets

Cited in

(2)

• Proving termination through conditional termination
• Multiphase-linear ranking functions and their relation to recurrent sets

This page was built for publication: Finding recurrent sets with backward analysis and trace partitioning

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