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...
Saved in:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Wiesbaden :
Vieweg+Teubner,
2011.
|
| Subjects: | |
| Online Access: | Full text (Wentworth users only). |
MARC
| LEADER | 00000cam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 8de6ff1a-fb6c-46f8-9951-17dfbfbb61fa | ||
| 005 | 20240722000000.0 | ||
| 008 | 110329s2011 gw | s |||| 0|eng d | ||
| 020 | |a 9783834899491 |9 978-3-8348-9949-1 | ||
| 024 | 7 | |a 10.1007/978-3-8348-9949-1 |2 doi | |
| 035 | |a (DE-He213)978-3-8348-9949-1 | ||
| 040 | |d UtOrBLW | ||
| 049 | |a WENN | ||
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UY |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 082 | 0 | 4 | |a 004 |2 23 |
| 100 | 1 | |a Herde, Christian. | |
| 245 | 1 | 0 | |a Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure |h [electronic resource] : |b Proof Engines for the Analysis of Hybrid Discrete-Continuous Systems / |c by Christian Herde. |
| 264 | 1 | |a Wiesbaden : |b Vieweg+Teubner, |c 2011. | |
| 300 | |a XVII, 163 pages 30 illustrations : |b digital. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 520 | |a 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 for discharging the proof obligations generated during the verification process. Christian Herde deals with the development of such procedures, providing methods for efficiently solving formulae comprising complex Boolean combinations of linear, polynomial, and transcendental arithmetic constraints, involving thousands of Boolean-, integer-, and real-valued variables. Although aiming at providing tool support for the verification of hybrid discrete-continuous systems, most of the techniques he describes are general purpose and have applications in many other domains, like operations research, planning, software validation, and electronic design automation. | ||
| 650 | 0 | |a Computer science. |0 sh 89003285 | |
| 710 | 2 | |a SpringerLink (Online service) |0 no2005046756 | |
| 773 | 0 | |t Springer eBooks | |
| 776 | 0 | 8 | |i Printed edition: |z 9783834814944 |
| 856 | 4 | 0 | |t 0 |u https://ezproxywit.flo.org/login?qurl=https://dx.doi.org/10.1007/978-3-8348-9949-1 |y Full text (Wentworth users only). |
| 999 | 1 | 0 | |i 8de6ff1a-fb6c-46f8-9951-17dfbfbb61fa |l w1381018 |s US-MBWI |m efficient_solving_of_large_arithmetic_constraint_systems_with_complex_elect2011_______viewea________________________________________herde__christian___________________e |
| 999 | 1 | 1 | |l w1381018 |s ISIL:US-MBWI |i Wentworth |t BKS |a Ebooks |c Springer |d Other scheme |p UNLOANABLE |