Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure Proof Engines for the Analysis of Hybrid Discrete-Continuous Systems /
Due to the growing use of more and more complex computerized systems in safety-critical applications, the formal verification of such systems is increasingly gaining importance. Many automatic and semi-automatic schemes for hardware and software verification ultimately rely on decision procedures fo...
Κύριος συγγραφέας: | Herde, Christian (Συγγραφέας) |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Wiesbaden :
Vieweg+Teubner,
2011.
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Bridging Constraint Satisfaction and Boolean Satisfiability
ανά: Petke, Justyna
Έκδοση: (2015) -
Boolean Function Complexity Advances and Frontiers /
ανά: Jukna, Stasys
Έκδοση: (2012) -
Complexity of Constraints An Overview of Current Research Themes /
Έκδοση: (2008) -
Constraint Solving and Planning with Picat
ανά: Zhou, Neng-Fa, κ.ά.
Έκδοση: (2015) -
Boolean Functions and Their Applications in Cryptography
ανά: Wu, Chuan-Kun, κ.ά.
Έκδοση: (2016)