This website requires JavaScript.
Explore
Help
Register
Sign in
kpriv
/
pkgsrc
Watch
1
Star
0
Fork
You've already forked pkgsrc
0
Code
Issues
Pull requests
Projects
Releases
Packages
Wiki
Activity
edf2ea6495
pkgsrc
/
devel
/
spin
/
PLIST
4 lines
86 B
Text
Raw
Normal View
History
Unescape
Escape
spin: updated to 6.4.7 Version 6.4.7: - fixed a bug in the parsing of for (...) statements if initialized variable declarations appear in the body of the loop - optimization in interpreting the swarm option, by avoiding unnecessary recompilations, plus other small fixes in the generation of parameter values for -k and -w with swarms - added runtime option -W to suppress recompilation of pan if the executable already exists - fixed bug in printing the value of a random seed at the end of a randomized run - added compilation warning if both -DNP and -DNOCLAIM are used (in that case -DNP is assumed to override -DNOCLAIM) - fixed a bug in the parsing of select (...) statements that could cause unwarranted syntax errors when larger ranges are used - switched to executables for Windows PCs that do not require a cygwin installation (using mingw32 and mingw64 bit compilations)
2017-12-10 14:56:34 +01:00
@comment $NetBSD: PLIST,v 1.2 2017/12/10 13:56:34 adam Exp $
Initial import of spin version 5.2.5 into the Packages Collection. To verify a design, a formal model is built using PROMELA, Spin's input language. PROMELA is a non-deterministic language, loosely based on Dijkstra's guarded command language notation and borrowing the notation for I/O operations from Hoare's CSP language. Spin can be used in four main modes: 1. as a simulator, allowing for rapid prototyping with a random, guided, or interactive simulations 2. as an exhaustive verifier, capable of rigorously proving the validity of user specified correctness requirements (using partial order reduction theory to optimize the search) 3. as proof approximation system that can validate even very large system models with maximal coverage of the state space. 4. as a driver for swarm verification (a new form of swarm computing), which can make optimal use of large numbers of available compute cores to leverage parallelism and search diversification techniques, which increases the chance of locating defects in very large verification models. With thanks to the plan9 guys for the nudge
2010-10-24 20:54:12 +02:00
bin/spin
spin: updated to 6.4.7 Version 6.4.7: - fixed a bug in the parsing of for (...) statements if initialized variable declarations appear in the body of the loop - optimization in interpreting the swarm option, by avoiding unnecessary recompilations, plus other small fixes in the generation of parameter values for -k and -w with swarms - added runtime option -W to suppress recompilation of pan if the executable already exists - fixed bug in printing the value of a random seed at the end of a randomized run - added compilation warning if both -DNP and -DNOCLAIM are used (in that case -DNP is assumed to override -DNOCLAIM) - fixed a bug in the parsing of select (...) statements that could cause unwarranted syntax errors when larger ranges are used - switched to executables for Windows PCs that do not require a cygwin installation (using mingw32 and mingw64 bit compilations)
2017-12-10 14:56:34 +01:00
man/man1/spin.1
Reference in a new issue
Copy permalink