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...
| Main Author: | Herde, Christian (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Wiesbaden :
Vieweg+Teubner,
2011.
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Bridging Constraint Satisfaction and Boolean Satisfiability
by: Petke, Justyna
Published: (2015) -
Boolean Function Complexity Advances and Frontiers /
by: Jukna, Stasys
Published: (2012) -
Constraint Solving and Planning with Picat
by: Zhou, Neng-Fa, et al.
Published: (2015) -
Complexity of Constraints An Overview of Current Research Themes /
Published: (2008) -
Boolean Functions and Their Applications in Cryptography
by: Wu, Chuan-Kun, et al.
Published: (2016)