FsCheck
algebra-driven-design
Our great sponsors
FsCheck | algebra-driven-design | |
---|---|---|
11 | 11 | |
1,132 | 129 | |
0.9% | - | |
8.1 | 4.3 | |
11 days ago | 5 months ago | |
F# | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
FsCheck
-
Property-based tests and clean architecture are perfect fit
As you can see from the imports statement we're relying on FsCheck to generate some random values for us.
-
When writing unit tests, what exactly am I looking for?
C# - FsCheck
-
Is there a tool that could be used to generate fake unit test cases automatically for code coverage? (read description before downvoting)
https://fscheck.github.io/FsCheck/ can hopefully generate random inputs automatically or with low effort for many methods to get your code coverage up. You don’t even need to write real tests right now, just call the methods with the random inputs and check they don’t fail.
-
Does anyone know of a good place to learn and practice some F# preferably F# 6 to be able to use Task.
Try using F# for tests. It has some great libraries like FsCheck (https://fscheck.github.io/FsCheck/).
-
Typesafe F# configuration binding
At Symbolica we're building a symbolic execution service that explores every reachable state of a user's program and verifies assertions at each of these states to check that the program is correct. By default it will check for common undefined behaviours, such as out-of-bounds memory reads or divide by zero, but it can also be used with custom, application specific, assertions too just like the kind you'd write in a unit test. Seen from this perspective it's kind of like FsCheck (or Haskell's QuickCheck or Python's Hypothesis), but much more exhaustive and without the randomness.
-
Does anybody know a simple algorithm for generating unit tests given a function's code?
Maybe something like QuickCheck, a quick search gave me this library for .NET https://github.com/fscheck/FsCheck
-
When do you consider your unit tests be "enough"?
Because of the above I've generally been using tools like Stryker.NET and FsCheck to augment my testing suite. I'm still doing unit testing to find the more obvious "I haven't had my coffee, let's make sure I'm doing what I think I'm doing" bugs. I'm just using things like mutation testing, property testing, fuzzing, etc. to find the deeper issues in my code. There's a ton of libraries out there, including one that I've built for myself to help with testing but FsCheck and Stryker are just beautiful. And if you're interested in fuzzing, SharpFuzz is a great option. But that one isn't quite as easy of an on ramp compared to the other two that I mentioned.
-
What are you working on? (2021-06)
Looks cool. Is there a reason why you didn't use FsCheck or Hedgehog? They're built to generate random data for testing, and can return the seed if a test fails so you can rerun the test with the exact same data once you figure out what the problem is - which is useful if the failure condition is rare.
-
Mutation Testing
Haskell has QuickCheck and Hedgehog, and dotnet has both as well. F# is favored, but there's C# interop.
-
How Good Are Your .NET Tests? Test Your Tests With Stryker Mutator
Side note, if you are thinking about testing in general, might be interested in property based testing. See for example https://fscheck.github.io/FsCheck/
algebra-driven-design
- What are some useful techniques for designing in functional languages?
-
Rust for projects that demand OOP type programming
You might want to read on Algebra-Driven Design and Data Oriented Design. If you are greedy, both books were pirated.
-
Does anyone use formal methods to validate the behaviour of programs/software at their job?
I would like to do this more. At the moment I don't do formal verification. However, I often borrow methodology from the excellent book Algebra-Driven Design (text available on GitHub but support the author if you find it useful!) when designing systems. This means I define algebraic data types to describe the program and the laws that relate the different types, and use that to guide implementation in a language that doesn't support ADTs.
- Best books for Haskell
-
Do you feel static types have "won the war", so to speak?
Their approach might be to express their business logic as a carefully selected collection of types and laws, as described in Algebra-Driven Design (the full text is available on GitHub, please support the author if you find it useful though). I recommend this book to everyone because, even if you don't use this approach to design your programs, it's an excellent way to think about problems and better understand the problem space.
-
Can someone message me explaining category theory and representation theory? I’m trying to choose a topic for independent study and need some help.
If you have an interest in computer science, category theory is very useful there. Here's a good book on the topic (Algebra-Driven Design, by Sandy Maguire).
-
Does anybody know a simple algorithm for generating unit tests given a function's code?
This reminds me of QuickSpec (different from QuickCheck) in Haskell. It takes Haskell code and finds the Mathematical laws that the code supports. It does this using a sort of smart random search. I learned about this as part of the Algebra Driven Design book.
- Source material for Algebra-Driven Design now available!
-
Advice on designing algebras
Sorry probably worth pointing out that I'm not referring to an Algebra in the pure math sense. I'm more referring to specifying algebraic laws that an API would have to satisfy as talked about in this book https://leanpub.com/algebra-driven-design.
What are some alternatives?
AutoFixture - AutoFixture is an open source library for .NET designed to minimize the 'Arrange' phase of your unit tests in order to maximize maintainability. Its primary goal is to allow developers to focus on what is being tested rather than how to setup the test scenario, by making it easier to create object graphs containing test data.
learn-you-a-haskell - “Learn You a Haskell for Great Good!” by Miran Lipovača
Bogus - :card_index: A simple fake data generator for C#, F#, and VB.NET. Based on and ported from the famed faker.js.
Agda - Agda is a dependently typed programming language / interactive theorem prover.
Expecto - A smooth testing lib for F#. APIs made for humans! Strong testing methodologies for everyone!
pynguin - The PYthoN General UnIt Test geNerator is a test-generation tool for Python
sharpfuzz - AFL-based fuzz testing for .NET
tcases - A model-based test case generator
Fluent Assertions - A very extensive set of extension methods that allow you to more naturally specify the expected outcome of a TDD or BDD-style unit tests. Targets .NET Framework 4.7, as well as .NET Core 2.1, .NET Core 3.0, .NET 6, .NET Standard 2.0 and 2.1. Supports the unit test frameworks MSTest2, NUnit3, XUnit2, MSpec, and NSpec3.
methods2test - methods2test is a supervised dataset consisting of Test Cases and their corresponding Focal Methods from a set of Java software repositories
hedgehog - Release with confidence, state-of-the-art property testing for Haskell.
austin-sbst - Automatically exported from code.google.com/p/austin-sbst