• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-Continuous

Efficient Solving of Large Arithmetic Constraint Systems with Complex Boolean Structure: Proof Engines for the Analysis of Hybrid Discrete-Continuous

Paperback

General Computers

ISBN10: 3834814946
ISBN13: 9783834814944
Publisher: Springer Nature
Published: Feb 10 2011
Pages: 163
Weight: 0.50
Height: 0.39 Width: 5.83 Depth: 8.27
Language: English
Christian Herde deals with the development of decision procedures as needed, e.g., for automatic verification of hardware and software systems via bounded model checking. He provides 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.

Also in

General Computers