scientific article; zbMATH DE number 1956595

MaRDI QIDQ4417941zbMATH OpenFDO

Authors Constantinos Bartzis, Tevfik Bultan

Publication date 30 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2619/26190394.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• BDDs for pseudo-Boolean constraints -- revisited
• A New Look at BDDs for Pseudo-Boolean Constraints
• Efficient Symbolic Representations for Arithmetic Constraints in Verification
• Constructive negation of arithmetic constraints using dataflow graphs
• Fast set bounds propagation using a BDD-SAT hybrid
• Bounded arithmetic for NC, ALogTIME, L and NL

Cited in

(6)

• scientific article; zbMATH DE number 2086591 (Why is no real title available?)
• Efficient Symbolic Representations for Arithmetic Constraints in Verification
• \textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks
• BDDs for pseudo-Boolean constraints -- revisited
• Correct Hardware Design and Verification Methods
• A New Look at BDDs for Pseudo-Boolean Constraints

Describes a project that uses

Uses Software

• NuSMV

This page was built for publication:

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