Search Results for "boolean logic minimizer"
Sort By:
Showing 31 open source projects for "boolean logic minimizer"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Simple, Secure Domain RegistrationRegister or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
-
1
YARA
The pattern matching swiss knife for malware researchers
YARA is a tool aimed at (but not limited to) helping malware researchers to identify and classify malware samples. With YARA you can create descriptions of malware families (or whatever you want to describe) based on textual or binary patterns. Each description, a.k.a rule, consists of a set of strings and a boolean expression which determines its logic. YARA is multi-platform, running on Windows, Linux and Mac OS X, and can be used through its command-line interface or from your own Python... -
2
Pundit
Minimal authorization through OO design and pure Ruby classes
Pundit (varvet/pundit) is a Ruby gem that provides a simple and effective framework for adding authorization logic to Rails (or other Ruby) applications. It centers around policy classes—one policy per model or resource—that define what actions a given user is permitted to perform (e.g., show?, update?, destroy?). Each policy method returns a boolean, and can be structured using combinators or shared logic to keep things DRY. In controllers and views, Pundit provides helpers like authorize... -
3
Fully Homomorphic Encryption
An FHE compiler for C++
... implementation, run a simulator to validate logic and performance characteristics, then compile to an encrypted form to run with real FHE parameters. The project includes benchmarking harnesses, examples, and tutorials that demystify parameter selection, gate costs, and latency/throughput trade-offs. Multiple runtimes and backends are supported so teams can choose Boolean or integer schemes depending on accuracy and speed needs. -
4
waymap
Waymap is a fast and optimized web vulnerability scanner
What is Waymap? Waymap is a fast and optimized And Automated web vulnerability scanner designed for penetration testers. It effectively identifies vulnerabilities by testing against a variety of payloads. Features Overview Latest Update v5.2.1 New Sql Injection Scanning Module High Accuracy And Less False Positive Access it using: --scan sqli v5.3.1 Added Boolean Based Sqli Testing (OWN LOGIC) High Accuracy, Can Give False Positive Sometimes Access it using: --scan sqli Waymap... -
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
5
mXparser - Math Parser Java C# Library
A flexible mathematical expressions parser for JAVA, Android, C# .NET
mXparser is highly flexible parser of math expressions. Software provides easy to use API for JAVA, Android, C# .NET/MONO (CLS). Main functionalities: - basic operators, i.e.: +, -, *, ^, ! - Boolean logic operators i.e.: or, and, xor - binary relations i.e.: =, <, > - math functions (large library of 1-arg, 2-arg, 3-arg - - functions) i.e.: sin, cos, Stirling numbers, log, inverse functions - constants (large library), i.e.: pi, e, golden ratio - n-args functions i.e.: greatest... -
6
Strategems
Quantitative systematic trading strategy development and backtesting
Strategems is a Julia package aimed at simplifying and streamlining the process of developing, testing, and optimizing algorithmic/systematic trading strategies. This package is inspired in large part by the quantstrat1,2 package in R, adopting a similar general structure to the building blocks that make up a strategy. Given the highly iterative nature of event-driven trading strategy development, Julia's high-performance design (particularly in the context of loops) and straightforward... -
7
C++ Math Expression Parser
C++ Math Expression Parser Library
The C++ Mathematical Expression Toolkit Library (ExprTk) is a simple to use, easy to integrate and extremely efficient run-time mathematical expression parser and evaluation engine. ExprTk supports numerous forms of functional, logical and vector processing semantics and is very easily extendible. Download http://partow.net/programming/exprtk/index.html -
8
FormSchema Native
Generate a form using JSON Schema and Vue.js
Vue component form based on JSON Schema and Native HTML. -
9
E2F1Map
Logic based simulations of E2F1 regulatory core for disease signatures
We provide comprehensive molecular interaction map of E2F1 transcription factor in tumor progression and metastasis. We provide various scripts, boolean based models to identify molecular signatures for predicting EMT phenotype in bladder and breast cancer model. -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
Logicheck
An interactive tool to test logical structures and expressions
This program is intended to be useful for testing Boolean logic or propositional logic. It sets out logical expressions with symbols such as "AND" and "OR" in a graphical user interface. A truth table can then be generated for any such set of expressions. It can also be used to test the validity of deductive arguments - the program will advise whether an argument is valid and if not, list the counter examples to the argument. -
11
CQU
Decision solver for Counting Quantifiers over Unary Predicates
---------------- cqusat 1.0 ---------------- cqusat is a conbstraint solver decides the satisfiability of a set of sentences containing Counting Quantifiers over Unary predicates. It also accepts Universally quantifies sentences over unary predicates, which are presented in the form of propositional clauses (classical Boolean logic clauses). This implementation employs minisat as the SAT solver. It also emplouys COIN-OR Clp linear programming solver... -
12
BoolCalc
Boolean Expression Evaluator with AND/XOR minimization
This is yet another boolean expression evaluator written in C/C++ with AND/XOR Sum-of-Product outputs. This is useful for projects that require heavy use of arithmetic functions, or multiplexors, where the XOR function dominates the logic expressions. There is also a similar tool with AND/OR/NOT output. -
13
Logic Calculator
A Calculator to perform logical operations
The Logic Calculator is an application useful to perform logical operations. It has three modes: (1) Evaluation of logic formulae: In this mode we have the basic boolean operations (negation, conjunction, disjunction, conditional and biconditional) so the user can insert the logic formula and the Logic Calculator displays the truth table along with the models of the formula. (2) Logical entailment: In this mode the user can insert a number of premises followed by a number of conclusions... -
14
Fast Tabular Local Logic Minimizer
CMOS circuit minimizer using table lookup
Given a circuit described in terms of common CMOS logic gates, this is capable of minimizing logic area by repetitive examination of sets of three gates, utilizing a pre-computed lookup table of pre-optimized replacements. Reductions include XOR gates and can be extended to 3-input logic gates. -
15
Math Processor
Math Processor is a general purpose programable math engine.
The design and code of Math Processor have been explained at: http://www.codeproject.com/Articles/500327/Building-a-General-Purpose-Interpreter-Math-Engine Math Processor solves problems relating to algebra, calculus, Boolean logic, statistics, number theory, geometry, trigonometry and other allied disciplines. It supports a simple interpreted language. It also has some plotting capabilities. You can use MP as a standalone calculating engine or you can use it as a C# .dll library in your... -
16
manticora
ternary logic calculator
Some scripts for boolean calculation, including a parser. Ternary logic support. Everything is written in Posix Sh. -
17
The Apelon DTS (Distributed Terminology System) is an integrated set of open source components that provides comprehensive terminology services in distributed application environments.
-
18
ExpressionOasis is a java based framework for evaluating the various type of expressions like arithmatic, logic expression etc. The framework is flexible enough to define any new grammer rules or operators.
-
19
QMC Logic Minimizer
combinational logic functions minimization
QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. Features: - You can minimize up to 16 input variables and up to 16 output... -
20
Quine-McCluskey minimizer
simplifies boolean functions with Quine-McCluskey algorithm
Small console application written in C to simplify boolean functions with the Quine-McCluskey algorithm -
21
Logic function minimization
Program for minimizing boolean functions not using Karnaugh K-maps
Logic function minimizer is a free open software, which is developed to solve the Digital Electronics design problems. Using Quine-McCluskey algorithm -
22
This program minimizes boolean expressions. After combining minterms as far as possible, the program draws a chart of prime implicants which the user can easily read and manipulate to remove any remaining superfluous implicants.
-
23
Quine-McCluskey boolean logic simplifier implemented in C++. It allows simplifying up to 32 variable input functions, including don't-care values. The program was written for digital design classes at the Poznan University of Technology (Poland).
-
24
c++ tools to convert any boolean formula to CNF or DNF, and make basic simplification. Please keep in mind that i'm still a student, and i'm open for any advice, criticism or question.
-
25
This project is a collection of tools that are useful for someone working in the computer engineering field. So far this program is able to do logic minimization using the Quine-McClusky Method, numeric base conversion, and some bit manipulations.
