| Port details |
- ctl-sat CTL (Computation Tree Logic) SAT solver
- g20200210 math
 =0      g20200210Version of this port present on the latest quarterly branch. - Maintainer: 0mp@FreeBSD.org
- Port Added: 2020-02-10 16:43:51
- Last Update: 2021-04-07 08:09:01
- Commit Hash: cf118cc
- License: MIT
- Description:
- CTL-SAT is a CTL (Computation Tree Logic) SAT solver. The user may test
satisfiability of a CTL formula may by providing it as a command-line argument
to the ctl-sat program, e.g.:
ctl-sat "~( (A(pUq) ^ AG(q->r) ^ AG(r->EXr)) -> EFEGr )"
The worst-case time complexity is O((2^n)^3) for this SAT solver, while the
worst-case space complexity is O((2^n)^2).
WWW: https://github.com/nicolaprezza/CTLSAT
- SVNWeb : git : Homepage
- pkg-plist: as obtained via:
make generate-plist - Dependency lines:
-
- To install the port:
- cd /usr/ports/math/ctl-sat/ && make install clean
- To add the package, run one of these commands:
- pkg install math/ctl-sat
- pkg install ctl-sat
- PKGNAME: ctl-sat
- Flavors: there is no flavor information for this port.
- distinfo:
- TIMESTAMP = 1581352735
SHA256 (nicolaprezza-CTLSAT-g20200210-6de41e0_GH0.tar.gz) = f285cc5ab39359b45d3a1b22c725393458624dea82f11b29ed9828cf523aa7ed
SIZE (nicolaprezza-CTLSAT-g20200210-6de41e0_GH0.tar.gz) = 1197332
- Packages (timestamps in pop-ups are UTC):
- There are no ports dependent upon this port
- Configuration Options:
- ===> The following configuration options are available for ctl-sat-g20200210:
DOCS=on: Build and/or install documentation
===> Use 'make config' to modify these settings
- Options name:
- math_ctl-sat
- FreshPorts was unable to extract/find any pkg message
- Master Sites:
|
Number of commits found: 3
| Commit History - (may be incomplete: see SVNWeb link above for full details) |
| Date | By | Description |
|---|
07 Apr 2021 08:09:01
  g20200210
|
Mathieu Arnold (mat) |
One more small cleanup, forgotten yesterday.
Reported by: lwhsu |
06 Apr 2021 14:31:07
g20200210
|
Mathieu Arnold (mat) |
Remove # $FreeBSD$ from Makefiles. |
10 Feb 2020 16:43:21
  g20200210
|
0mp |
New port: math/ctl-sat: CTL (Computation Tree Logic) SAT solver
CTL-SAT is a CTL (Computation Tree Logic) SAT solver. The user may test
satisfiability of a CTL formula may by providing it as a command-line
argument to the ctl-sat program, e.g.:
ctl-sat "~( (A(pUq) ^ AG(q->r) ^ AG(r->EXr)) -> EFEGr )"
The worst-case time complexity is O((2^n)^3) for this SAT solver, while the
worst-case space complexity is O((2^n)^2).
WWW: https://github.com/nicolaprezza/CTLSAT |
Number of commits found: 3
|
As an Amazon Associate I earn from qualifying purchases.