sbv-7.0: SMT Based Verification: Symbolic Haskell theorem prover using SMT solving.

Copyright(c) Levent Erkok
LicenseBSD3
Maintainererkokl@gmail.com
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Data.SBV.Examples.BitPrecise.BitTricks

Description

Checks the correctness of a few tricks from the large collection found in: https://graphics.stanford.edu/~seander/bithacks.html

Synopsis

Documentation

fastMinCorrect :: SInt32 -> SInt32 -> SBool Source #

Formalizes https://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax

fastMaxCorrect :: SInt32 -> SInt32 -> SBool Source #

Formalizes https://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax

oppositeSignsCorrect :: SInt32 -> SInt32 -> SBool Source #

Formalizes https://graphics.stanford.edu/~seander/bithacks.html#DetectOppositeSigns

conditionalSetClearCorrect :: SBool -> SWord32 -> SWord32 -> SBool Source #

Formalizes https://graphics.stanford.edu/~seander/bithacks.html#ConditionalSetOrClearBitsWithoutBranching

powerOfTwoCorrect :: SWord32 -> SBool Source #

Formalizes https://graphics.stanford.edu/~seander/bithacks.html#DetermineIfPowerOf2

queries :: IO () Source #

Collection of queries