Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/55305
-
Title: 
On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
-
Citation: 
Kovásznai, G., Veith, H., Fröhlich, A., & Biere, A. (2014). On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic. In Mathematical Foundations of Computer Science 2014 (pp. 481–492). Springer / LNCS. https://doi.org/10.1007/978-3-662-44465-8_41
-
Publisher DOI: 
10.1007/978-3-662-44465-8_41
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Kovásznai, Gergely 
Veith, Helmut 
Fröhlich, Andreas 
Biere, Armin 
-
Organisational Unit: 
E192-04 - Forschungsbereich Formal Methods in Systems Engineering 
E192 - Institut für Logic and Computation 
-
Published in: 
Mathematical Foundations of Computer Science 2014 
-
Date (published): 
2014
-
Event name: 
International Symposium on Mathematical Foundations of Computer Science (MFCS) 
-
Event date: 
26-Aug-2013 - 30-Aug-2013
-
Event place: 
Klosterneuburg, Austria, Austria
-
Number of Pages: 
12
-
Publisher: 
Springer / LNCS, 8635
-
Peer reviewed: 
Yes
-
Research Areas: 
Distributed and Parallel Systems: 10%
Computer Engineering and Software-Intensive Systems: 20%
Logic and Computation: 70%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

179
checked on Nov 23, 2023

Google ScholarTM

Check