Abstract
BLACK, short for Bounded Ltl sAtisfiability ChecKer, is a recently developed software tool for satisfia-
bility checking of Linear Temporal Logic (LTL) formulas. It supports formulas using both future and past
operators, interpreted over both infinite and finite traces. At its core, BLACK uses an incremental SAT
encoding of the one-pass tree-shaped tableau for LTL recently developed by Reynolds, which guarantees
completeness thanks to its particular pruning rule. This paper gives an overview of the tool, surveys
the main design choices underlying its implementation, describes its features and discusses potential
future developments.