Formal Methods in Computer-Aided Design

DOI10.1007/B102264zbMATH Open1117.68435OpenAlexW4229585471MaRDI QIDQ5492995FDOQ5492995

Subramanian Iyer, Christian Stangier, Debashis Sahoo, David L. Dill, E. Allen Emerson, Jawahar Jain, Amit Narayan

Publication date: 20 October 2006

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

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

Recommendations

• An improved hierarchy result for partitioned BDDs
• Improved symbolic verification using partitioning techniques
• FM 2005: Formal Methods
• Partitioning methods for satisfiability testing on large formulas
• Partitioning methods for satisfiability testing on large formulas
• Publication:4733386
• scientific article; zbMATH DE number 5636822
• Dynamic partitioning in linear relation analysis: application to the verification of reactive systems
• Experimental and Efficient Algorithms

Mathematics Subject Classification ID

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

Cited In (4)

• Computer Aided Verification
• A compositional approach to probabilistic knowledge compilation
• Theorem Proving in Higher Order Logics
• Title not available (Why is that?)

This page was built for publication: Formal Methods in Computer-Aided Design

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