Complexity of Fixed-Size Bit-Vector Logics
Complexity of Fixed-Size Bit-Vector Logics
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
Bit-precise reasoning is important for many practical applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. From the theoretical point of view, only few results on the complexity of fixed-size bit-vector logics have been published. Some of these re...
Alternative Titles
Full title
Complexity of Fixed-Size Bit-Vector Logics
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1835562866
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1835562866
Other Identifiers
ISSN
1432-4350
E-ISSN
1433-0490
DOI
10.1007/s00224-015-9653-1
