Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel webring send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
Dyninst integration for AFL++
FUZZOLIC is a concolic executor based on QEMU.
It can instrument binary programs at runtime in order to build symbolic expressions and queries. To reduce the runtime overhead and improve accuracy of the queries, it devises three analysis modes that are dynamically enabled during the program execution based on the running context.
Moreover, differently from other concolic executors, FUZZOLIC runs the solver component, which reasons over the symbolic queries generated when analyzing a program, inside another process to reduce execution interferences that may be caused by the solver and negatively affect the analyzed application.
CIVL is a framework encompassing
a programming language, CIVL-C, which adds to C a number of concurrency primitives, as well as the to define functions in any scope. Together, these features make for a very expressive concurrent language that can faithfully represent programs using various APIs and parallel languages, such as MPI, OpenMP, CUDA, and Chapel. CIVL-C also provides a number of primitives supporting verification.
a model checker which uses symbolic execution to verify a number of safety properties of CIVL-C programs. The model checker can also be used to verify that two CIVL-C programs are functionally equivalent.
a number of translators from various commonly-used concurrency languages/APIs to CIVL-C (currently, MPI, OpenMP, Pthreads, and CUDA).
Taosc generates emergent fixes for binaries.
SymInfer is an invariant generation tool that discovers program properties at arbitrary program locations (e.g., loop invariants, post conditions). It infers program invariants or properties over program execution traces or program source code. SymInfer supports many forms of numerical invariants, including nonlinear equalities, octagonal and interval properties, min/max-plus relations, and congruence relations.
Pacfix systhesizes predicate expressions for program repair from values in possitive and negative examples using a PAC learning algorithm.