Creează un cont pentru a te abona la acest blog și a-i urmări articolele pe pagina Lectură.
-
Finding All Solutions to LinkedIn Queens with a SAT Solver and Model Checkers
LinkedIn Queens is a puzzle played on an n × n grid with the following rules: The grid is divided into n colored regions.
-
How to Solve Santa Claus Concurrency Puzzle with a Model Checker
When I enjoy a book, I often look for other work by the same author.
-
Reproducing the AWS Outage Race Condition with a Model Checker
AWS published a post-mortem about a recent outage [1].
-
When the Simplest Concurrent Program Goes Against All Intuition
I came across a fascinating and surprising aspect of a seemingly simple concurrent program when run on a model checker.
-
How concurrency works: A visual guide
Concurrent programming is hard.
-
How Rendezvous Channels Work in PROMELA (SPIN)
PROMELA is a language used to write models that can be validated with the SPIN model checker.
-
How Control Structures Work in PROMELA (SPIN)
The PROMELA language is used to write models in the SPIN model checker.
-
The Beautiful Simplicity of the Gentzen System
Gentzen system, created by German mathematician Gerhard Gentzen, is a deductive system which can be used to prove propositional formulas.