IEEE

Boolean Gröbner Basis Reductions on Finite Field Datapath Circuits Using the Unate Cube Set Algebra

Abstract: Recent developments in formal verification of arithmetic datapaths make efficient use of symbolic computer algebra algorithms. The circuit is modeled as an ideal in polynomial rings, and ...
GitHub

FLRE - Fast Light Regular Expressions - A fast light regular expression library

FLRE ( F ast L ight R egular E xpressions) is a fast, safe and efficient regular expression library, which is implemented in Object Pascal (Delphi and Free Pascal) but which is even usable from other ...
GitHub

using torch.sym_not cause Z3Exception: Symbolic expressions cannot be cast to concrete Boolean values.

PYTORCH_TEST_WITH_ASAN=1 PYTORCH_TEST_WITH_UBSAN=1 python test/dynamo/test_dynamic_shapes.py DynamicShapesReproTests.test_issue175_dynamic_shapes File "/home/lsakka ...
IEEE

Set Stabilization of Probabilistic Boolean Networks Using Pinning Control

Abstract: Probabilistic Boolean network (PBN) is a kind of stochastic logical system in which update functions are randomly selected from a set of candidate Boolean functions according to a prescribed ...