(no commit message)
authorcolepoirier@1ec9c8c87c85f09e4718cd80e0605065e33975f0 <colepoirier@1ec9c8c87c85f09e4718cd80e0605065e33975f0@web>
Thu, 29 Oct 2020 20:57:19 +0000 (20:57 +0000)
committerIkiWiki <ikiwiki.info>
Thu, 29 Oct 2020 20:57:19 +0000 (20:57 +0000)
resources.mdwn

index e019de334838feef2e6121fa904d3afd254a91d8..448b7d2ec663b69fd613380253522cc6b0f6e9c2 100644 (file)
@@ -281,7 +281,9 @@ regards to what we specify.  Of course, it is important to do the formal
 verification as a final step in the development process before we produce
 thousands or millions of silicon.
 
-* Possible way to speed up our solvers for our formal proofs <https://github.com/eth-sri/fastsmt>
+* Possible way to speed up our solvers for our formal proofs <https://web.archive.org/web/20201029205507/https://github.com/eth-sri/fastsmt>
+
+* Algorithms (papers) submitted for 2018 International SAT Competition <https://web.archive.org/web/20201029205239/https://helda.helsinki.fi/bitstream/handle/10138/237063/sc2018_proceedings.pdf> <https://web.archive.org/web/20201029205637/http://www.satcompetition.org/>
 
 Some learning resources I found in the community: