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...
| প্রধান লেখক: | |
|---|---|
| সংস্থা লেখক: | |
| বিন্যাস: | Electronic Resource |
| ভাষা: | English |
| প্রকাশিত: |
Wiesbaden
Vieweg+Teubner
2011.
|
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Available for University of the Philippines Diliman via SpringerLink. Click here to access |