Hochschulschrift
Efficient SMT solving for bit vectors and the extensional theory of arrays
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783854997078
- Dimensions
-
21 cm
- Extent
-
142 S.
- Language
-
Deutsch
- Notes
-
graph. Darst.
Zugl.: Linz, Univ., Diss., 2009
- Bibliographic citation
-
Schriften der Johannes-Kepler-Universität Linz / C / Johannes Kepler Universität Linz ; 61, Reihe C
- Keyword
-
Bitvektor
Array
Extensionale Logik
Erfüllbarkeitsproblem
Entscheidungsverfahren
Debugging
Verifikation
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:35 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Brummayer, Robert
- Trauner
Time of origin
- 2010
Other Objects (12)
From Local Search to Quantifier Elimination for Bit-Vectors in SMT
Modular strategic SMT solving with SMT-RAT
SMT solving, interpolation, and quantifiers
Learning probabilistic automata with SMT solving
Automatic abstraction for bit-vectors using decision procedures
Automatic abstraction for bit-vectors using decision procedures
Integrating virtual substitution into strategic SMT solving
Iterative arrays with a wee bit alternation
Solving nonlinear systems with least significant bit accuracy
Proving termination of probabilistic recursive programs via SMT-solving
Fluent Bit: Solving Logging Challenges for Cloud Native Environments
Elementary vectors
From Local Search to Quantifier Elimination for Bit-Vectors in SMT
Modular strategic SMT solving with SMT-RAT
SMT solving, interpolation, and quantifiers
Learning probabilistic automata with SMT solving
Automatic abstraction for bit-vectors using decision procedures
Automatic abstraction for bit-vectors using decision procedures
Integrating virtual substitution into strategic SMT solving
Iterative arrays with a wee bit alternation
Solving nonlinear systems with least significant bit accuracy
Proving termination of probabilistic recursive programs via SMT-solving
Fluent Bit: Solving Logging Challenges for Cloud Native Environments
Elementary vectors
From Local Search to Quantifier Elimination for Bit-Vectors in SMT
Modular strategic SMT solving with SMT-RAT
SMT solving, interpolation, and quantifiers
Learning probabilistic automata with SMT solving
Automatic abstraction for bit-vectors using decision procedures
Automatic abstraction for bit-vectors using decision procedures
Integrating virtual substitution into strategic SMT solving
Iterative arrays with a wee bit alternation
Solving nonlinear systems with least significant bit accuracy
Proving termination of probabilistic recursive programs via SMT-solving
Fluent Bit: Solving Logging Challenges for Cloud Native Environments