You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
description="The Cryptographic Protocol Shapes Analyzer (CPSA) attempts to\nenumerate all essentially different executions possible for a\ncryptographic protocol. We call them the shapes of the protocol.\nMany naturally occurring protocols have only finitely many, indeed\nvery few shapes. Authentication and secrecy properties are easy to\ndetermine from them, as are attacks and anomalies, and an auxiliary\ntool reads off strongest authentication and secrecy goals from the\nshapes.\n\nFor each input problem, the CPSA program is given some initial\nbehavior, and it discovers what shapes are compatible with it.\nNormally, the initial behavior is from the point of view of one\nparticipant. The analysis reveals what the other participants must\nhave done, given the participant's view. The search is complete,\ni.e. we proved every shape can in fact be found in a finite number\nof steps, relative to a procedural semantics of protocol roles.\n\nThe package contains a set of programs used to perform the analysis\nand display it in a browser. Program documentation is in the doc\ndirectory in the source distribution, and installed in the package's\ndata directory. You can locate the package's data directory by\ntyping \"cpsa --help\" to a command prompt. New users should study\nthe documentation and the sample inputs in the data directory. The\nsource distribution includes a test suite with an expanded set of\ninput files and is easily installed on operating systems that decend\nfrom Unix. Serious Windows users should install MSYS so as to allow\nthe use of make and script execution.\n\nThe theory and algorithm used by CPSA was developed with the help of\nJoshua D. Guttman, John D. Ramsdell, Jon C. Herzog, Shaddin\nF. Doghmi, F. Javier Thayer, Paul D. Rowe, and Moses D. Liskov.\nJohn D. Ramsdell implemented the algorithm in Haskell. CPSA was\ndesigned and implemented at The MITRE Corporation.";
synopsis="A monad for interfacing with external SMT solvers";
22
+
description="Hasmtlib is a library for generating SMTLib2-problems using a monad.\nIt takes care of encoding your problem, marshaling the data to an external solver and parsing and interpreting the result into Haskell types.\nIt is highly inspired by ekmett/ersatz which does the same for QSAT.\nCommunication with external solvers is handled by tweag/smtlib-backends.";
synopsis="Multivariate polynomials and fractions of multivariate polynomials.";
22
+
description="Manipulation of multivariate polynomials over a commutative ring and fractions of multivariate polynomials over a commutative field, Gröbner bases, resultant, subresultants, Sturm-Habicht sequence, and greatest common divisor. It is possible to deal with multivariate polynomials whose coefficients are fractions of multivariate polynomials, and they can be interpreted as parametric polynomials with symbolic parameters.";
0 commit comments