Hochschulschrift
SAT-based verification : from core algorithms to novel application domains
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Freiburg (Breisgau), Univ., Diss., 2008
- Klassifikation
-
Elektrotechnik, Elektronik
- Schlagwort
-
Erfüllbarkeitsproblem ; Verifikation ; Bounded Model Checking
- Urheber
- URN
-
urn:nbn:de:bsz:25-opus-53801
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 14.08.2025, 11:00 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
Ähnliche Objekte (12)
SAT-Based Scalable Formal Verification Solutions
Design and Verification of the Attitude Determination and Control Algorithms for the SOURCE CubeSat
Design and Verification of the Attitude Determination and Control Algorithms for the SOURCE CubeSat
SAT Compilation for Constraints over Structured Finite Domains
A Survey on Exact Algorithms of SAT
MIZAR verification of generic algebraic algorithms
Basidiomycete non-reducing polyketide synthases function independently of SAT domains
Lectures on proof verification and approximation algorithms
Petri Net Based Verification of Distributed Algorithms
Parallel algorithms for verification of large systems
Algorithms for Variable-Weighted 2-SAT and Dual Problems
SAT-based Formal Verification of Fault Injection Countermeasures for Cryptographic Circuits
SAT-Based Scalable Formal Verification Solutions
Design and Verification of the Attitude Determination and Control Algorithms for the SOURCE CubeSat
Design and Verification of the Attitude Determination and Control Algorithms for the SOURCE CubeSat
SAT Compilation for Constraints over Structured Finite Domains
A Survey on Exact Algorithms of SAT
MIZAR verification of generic algebraic algorithms
Basidiomycete non-reducing polyketide synthases function independently of SAT domains
Lectures on proof verification and approximation algorithms
Petri Net Based Verification of Distributed Algorithms
Parallel algorithms for verification of large systems
Algorithms for Variable-Weighted 2-SAT and Dual Problems
SAT-based Formal Verification of Fault Injection Countermeasures for Cryptographic Circuits
SAT-Based Scalable Formal Verification Solutions
Design and Verification of the Attitude Determination and Control Algorithms for the SOURCE CubeSat
Design and Verification of the Attitude Determination and Control Algorithms for the SOURCE CubeSat
SAT Compilation for Constraints over Structured Finite Domains
A Survey on Exact Algorithms of SAT
MIZAR verification of generic algebraic algorithms
Basidiomycete non-reducing polyketide synthases function independently of SAT domains
Lectures on proof verification and approximation algorithms
Petri Net Based Verification of Distributed Algorithms
Parallel algorithms for verification of large systems
Algorithms for Variable-Weighted 2-SAT and Dual Problems