Hochschulschrift
Complete symbolic simulation of systemC models : efficient formal verification of finite non-terminating programs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783658126797
3658126795
- Maße
-
21 cm
- Umfang
-
ix, 162 Seiten
- Sprache
-
Englisch
- Anmerkungen
-
Illustrationen
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Wiesbaden
- (wer)
-
Springer Vieweg
- (wann)
-
[2016]
- Urheber
- Beteiligte Personen und Organisationen
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:12 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
- Herdt, Vladimir
- Springer Fachmedien Wiesbaden
- Springer Vieweg
Entstanden
- [2016]
Ähnliche Objekte (12)
symQV : Automated Symbolic Verification of Quantum Programs
Reasoning about terminating functional programs
Reasoning about terminating functional programs
Integrating Symbolic Execution, Debugging and Verification
A complete and terminating execution model for Constraint Handling Rules
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
Complete Functional Verification
Verification of pointer programs
Relatively complete verification of probabilistic programs : an expressive language for expectation-based reasoning
Interactive Verification of Concurrent Systems using Symbolic Execution
Verification of business rules programs
Verification of Java card programs
symQV : Automated Symbolic Verification of Quantum Programs
Reasoning about terminating functional programs
Reasoning about terminating functional programs
Integrating Symbolic Execution, Debugging and Verification
A complete and terminating execution model for Constraint Handling Rules
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
Complete Functional Verification
Verification of pointer programs
Relatively complete verification of probabilistic programs : an expressive language for expectation-based reasoning
Interactive Verification of Concurrent Systems using Symbolic Execution
Verification of business rules programs
Verification of Java card programs
symQV : Automated Symbolic Verification of Quantum Programs
Reasoning about terminating functional programs
Reasoning about terminating functional programs
Integrating Symbolic Execution, Debugging and Verification
A complete and terminating execution model for Constraint Handling Rules
Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
Complete Functional Verification
Verification of pointer programs
Relatively complete verification of probabilistic programs : an expressive language for expectation-based reasoning
Interactive Verification of Concurrent Systems using Symbolic Execution
Verification of business rules programs