analyze.rb

@@ -35,7 +35,6 @@ end
 
 data = {}
 id = 0
-series = {}
 files.each do |file|
   id += 1
   name = file
@@ -50,12 +49,6 @@ files.each do |file|
       name = $~[1].delete_prefix('"').delete_suffix('"')
     elsif l =~ /^draft: true$/
       draft = true
-    elsif l =~ /^series: (.+)$/
-      this_series = $~[1]
-      series_list = series.fetch(this_series) do
-        series[this_series] = []
-      end
-      series_list << file
     elsif l =~ /^tags: (.+)$/
       tags = $~[1].delete_prefix("[").delete_suffix("]").split(/,\s?/).map { |it| it.gsub('"', '') }
       if tags.include? "Compilers"
@@ -93,14 +86,6 @@ files.each do |file1|
     edges << { :from => data[file1][:id], :to => data[ref][:id] }
   end
 end
-series.each do |series, files|
-  files.sort.each_cons(2) do |file1, file2|
-    next unless data[file1]
-    next unless data[file2]
-    edges << { :from => data[file1][:id], :to => data[file2][:id] }
-    edges << { :from => data[file2][:id], :to => data[file1][:id] }
-  end
-end
 edges.uniq
 # edges.filter! { |e| e[:from] < e[:to] }
 

content/blog/00_spa_agda_intro.md

@@ -2,7 +2,7 @@
 title: "Implementing and Verifying \"Static Program Analysis\" in Agda, Part 0: Intro"
 series: "Static Program Analysis in Agda"
 description: "In this post, I give a top-level overview of my work on formally verified static analyses"
-date: 2024-05-30T19:36:58-07:00
+date: 2024-04-12T14:23:03-07:00
 draft: true
 tags: ["Agda", "Programming Languages"]
 ---
@@ -37,7 +37,8 @@ this milestone, I'd like to pause and talk about what I've done.
 In subsequent posts in this series, will describe what I have so far.
 It's not perfect, and some work is yet to be done; however, getting to
 this point was no joke, and I think it's worth discussing. In all,
-I'd like to cover the following major topics, spending a couple of posts on each:
+I envision three major topics to cover, each of which is likely going to make
+for a post or two:
 
 * __Lattices__: the analyses I'm reasoning about use an algebraic structure
   called a _lattice_. This structure has certain properties that make it
@@ -45,13 +46,12 @@ I'd like to cover the following major topics, spending a couple of posts on each
   lattice-based static program analysis, the various elements of the
   lattice represent different facts or properties that we know about the
   program in question; operations on the lattice help us combine these facts
-  and reason about them. I write about this in [Part 1: Lattices]({{< relref "01_spa_agda_lattices" >}}).
+  and reason about them.
 
   Interestingly, lattices can be made by combining other lattices in certain
   ways. We can therefore use simpler lattices as building blocks to create
   more complex ones, all while preserving the algebraic structure that
-  we need for program analysis. I write about this in
+  we need for program analysis.
-  [Part 2: Combining Lattices]({{< relref "02_spa_agda_combining_lattices" >}}).
 
 * __The Fixed-Point Algorithm__: to analyze a program, we use information
   that we already know to compute additional information. For instance,
@@ -85,9 +85,6 @@ I'd like to cover the following major topics, spending a couple of posts on each
   CFGs that make sense, our analysis produces results that match the language's
   execution.
 
-
+{{< todo >}}
-### Navigation
+Once the posts are ready, link them here to add some kind of navigation.
-Here are the posts that I’ve written so far for this series:
+{{< /todo >}}
-
-* [Lattices]({{< relref "01_spa_agda_lattices" >}})
-* [Combining Lattices]({{< relref "02_spa_agda_combining_lattices" >}})

content/blog/01_learning_emulation.md

@@ -1,6 +1,6 @@
 ---
 title: Learning Emulation, Part 1
-date: 2016-06-27
+date: 2016-11-23 23:22:42.779811
 tags: ["Emulation"]
 ---
 I've decided that the purpose of a blog is to actually use it every once in a while. So, to fill up this blank space, I'll be documenting my own experience of starting to learn how emulation works. I'd like to say right now that my main goal was not to learn emulation. Rather, I needed to emulate to refresh my skills for a different subject area. However, emulation turned out fun enough to write about.

content/blog/01_spa_agda_lattices.md

@@ -1,8 +1,7 @@
 ---
 title: "Implementing and Verifying \"Static Program Analysis\" in Agda, Part 1: Lattices"
 series: "Static Program Analysis in Agda"
-description: "In this post, I introduce an algebraic structure called a lattice, which underpins certain program analyses"
+date: 2024-04-13T14:23:03-07:00
-date: 2024-05-30T19:36:59-07:00
 draft: true
 tags: ["Agda", "Programming Languages"]
 ---

content/blog/02_learning_emulation.md

@@ -1,6 +1,6 @@
 ---
 title: Learning Emulation, Part 2
-date: 2016-06-29
+date: 2016-11-23 23:23:18.664038
 tags: ["C", "Emulation"]
 ---
 _This is the second post in a series I'm writing about Chip-8 emulation. If you want to see the first one, head [here]({{< relref "/blog/01_learning_emulation.md" >}})._

content/blog/02_spa_agda_combining_lattices.md

@@ -1,8 +1,7 @@
 ---
 title: "Implementing and Verifying \"Static Program Analysis\" in Agda, Part 2: Combining Lattices"
 series: "Static Program Analysis in Agda"
-description: "In this post, I describe how lattices can be combined to create other, more complex lattices"
+date: 2024-04-13T14:23:03-07:01
-date: 2024-05-30T19:37:00-07:00
 draft: true
 tags: ["Agda", "Programming Languages"]
 ---

content/blog/03_learning_emulation.md

@@ -1,6 +1,6 @@
 ---
 title: Learning Emulation, Part 2.5 - Implementation
-date: 2016-06-30
+date: 2016-11-23 23:23:56.633942
 tags: ["C", "Emulation"]
 ---
 _This is the third post in a series I'm writing about Chip-8 emulation. If you want to see the first one, head [here]({{< relref "/blog/01_learning_emulation.md" >}})._