{"@attributes":{"version":"2.0"},"channel":{"title":"Basil Crow\u2019s Weblog","link":"https:\/\/basilcrow.com\/blog\/","description":"Basil Crow\u2019s personal weblog on software engineering and technology","language":"en-us","managingEditor":"me@basilcrow.com (Basil Crow)","webMaster":"me@basilcrow.com (Basil Crow)","lastBuildDate":"Wed, 15 Jul 2026 00:00:00 GMT","item":[{"guid":"https:\/\/basilcrow.com\/blog\/reflections-on-a-decade-of-open-source-contributions\/","title":"Reflections on a Decade of Open Source Contributions","link":"https:\/\/basilcrow.com\/blog\/reflections-on-a-decade-of-open-source-contributions\/","description":"Lessons learned from maintaining open source software over the past decade.","pubDate":"Wed, 15 Jul 2026 00:00:00 GMT","author":"me@basilcrow.com (Basil Crow)","category":"open source"},{"guid":"https:\/\/basilcrow.com\/blog\/relaxing-knuths-restrictions\/","title":"Relaxing Knuth\u2019s Restrictions: Break-Dependent Widths in Optimal Line Breaking","link":"https:\/\/basilcrow.com\/blog\/relaxing-knuths-restrictions\/","description":"Extending the Knuth-Plass line-breaking algorithm to handle widths that depend on break decisions.","pubDate":"Mon, 06 Apr 2026 00:00:00 GMT","author":"me@basilcrow.com (Basil Crow)","category":"algorithms"},{"guid":"https:\/\/basilcrow.com\/blog\/recovering-arguments-and-environment-variables-from-a-core-dump\/","title":"Recovering arguments and environment variables from a core dump","link":"https:\/\/basilcrow.com\/blog\/recovering-arguments-and-environment-variables-from-a-core-dump\/","description":"When the right stack pages survive in a core dump, they still contain the full arguments and environment. Here is how to recover them when ELF notes and journal metadata fall short.","pubDate":"Sat, 04 Apr 2026 00:00:00 GMT","author":"me@basilcrow.com (Basil Crow)","category":"linux"},{"guid":"https:\/\/basilcrow.com\/blog\/optimal-line-breaks\/","title":"Optimal Line Breaks, LeetCode-Style","link":"https:\/\/basilcrow.com\/blog\/optimal-line-breaks\/","description":"A LeetCode-style problem about optimal line breaking, inspired by the Knuth-Plass algorithm used in TeX and LaTeX.","pubDate":"Fri, 06 Mar 2026 00:00:00 GMT","author":"me@basilcrow.com (Basil Crow)","category":"algorithms"},{"guid":"https:\/\/basilcrow.com\/blog\/navigating-the-security-compatibility-tradeoff\/","title":"Navigating the Security\/Compatibility Tradeoff with Escape Hatches","link":"https:\/\/basilcrow.com\/blog\/navigating-the-security-compatibility-tradeoff\/","description":"Security and compatibility often clash. Escape hatches offer the best of both worlds by being secure by default while providing a path for compatibility.","pubDate":"Sat, 30 Aug 2025 00:00:00 GMT","author":"me@basilcrow.com (Basil Crow)","category":"security"}]}}