Abstract
Word-level predicates involve high-level descriptions of integer variables and can be complex to represent and manipulate with traditional decision diagrams like BDDs (binary decision diagrams) and MDDs (multiple-valued decision diagrams). We propose a new type of decision diagram nodes, called LD-nodes (lazy decision nodes), for word-level inequalities that allow for lazy evaluation. Such nodes can be incorporated in BDDs, MDDs, and CRDs (clock-restriction diagrams). We present algorithms for operations on diagrams with LDD nodes. We then report our experiment of our technology with several benchmarks. A library implementing the approach is available at Source Forge web page for project REDLIB.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
