Hochschulschrift
Efficient SMT solving for bit vectors and the extensional theory of arrays
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783854997078
- Maße
-
21 cm
- Umfang
-
142 S.
- Sprache
-
Deutsch
- Anmerkungen
-
graph. Darst.
Zugl.: Linz, Univ., Diss., 2009
- Erschienen in
-
Schriften der Johannes-Kepler-Universität Linz / C / Johannes Kepler Universität Linz ; 61, Reihe C
- Schlagwort
-
Bitvektor
Array
Extensionale Logik
Erfüllbarkeitsproblem
Entscheidungsverfahren
Debugging
Verifikation
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:35 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Brummayer, Robert
- Trauner
Entstanden
- 2010
Ähnliche Objekte (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