Tag
constraint-solving
- Aug 18, 2026 What a Version Range Selects: The Interval Algebra Behind Caret and Tilde How comparators, disjunction, and prerelease exclusion turn a version constraint into a concrete set of versions, and where the range language stops describing compatibility at all. software engineering
- Jul 27, 2026 Resolution as Constraint Search: Why Dependency Solving Is NP-Hard How a resolver chooses versions for a whole graph at once, why the general problem resists polynomial algorithms, and which practical strategies keep real graphs solvable. software engineering
- Aug 21, 2025 May-Alias Analysis and the Shape of a Points-To Set Why a write through one reference can change what another observes, how inclusion and unification constraints differ, and what field sensitivity costs. developer tools
- Sep 27, 2023 Version Ranges as Sets of Versions How a constraint such as ^1.2.3 becomes an explicit set of admissible versions, how two constraints intersect, and why prerelease rules stop that set from being an interval. developer tools
- Aug 4, 2023 Dependency Resolution as a Satisfiability Problem How version selection encodes into boolean clauses, why the decision problem is NP-complete, and what that bound predicts about real installs and about optimisation criteria. developer tools