<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/mkf/c"><title>BibSonomy bookmarks for /user/mkf/c</title><link>https://www.bibsonomy.org/user/mkf/c</link><description>BibSonomy RSS Feed for /user/mkf/c</description><items><rdf:Seq><rdf:li rdf:resource="https://man.openbsd.org/style.9"/><rdf:li rdf:resource="https://www.cs.princeton.edu/~appel/vc/Verif_reverse.html#lab32"/></rdf:Seq></items></channel><item rdf:about="https://man.openbsd.org/style.9"><title>style(9) - OpenBSD manual pages</title><description></description><link>https://man.openbsd.org/style.9</link><dc:creator>mkf</dc:creator><dc:date>2022-01-20T13:25:22+01:00</dc:date><dc:subject>c c_style_guides </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2022-01-20T13:25:22+01:00&#034; href=&#034;https://man.openbsd.org/style.9&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://man.openbsd.org/style.9&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c_style_guides"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.cs.princeton.edu/~appel/vc/Verif_reverse.html#lab32"><title>Verif_reverse: Linked lists in Verifiable C</title><description>linked to me from https://twitter.com/cattheory/status/1220803662802489344 (by Joomy Korkut, PhD student in programming languages at Princeton https://cs.princeton.edu/~ckorkut/) — « not a language but a way to reason about C programs in Coq: VST lets you define separation logic predicates that describe how a Coq type would be represented in C: https://cs.princeton.edu/~appel/vc/Verif_reverse.html#lab32 \n\n might be interesting to you, or not, I don&#039;t know. » at 9:20 PM CET on Jan 24, 2020</description><link>https://www.cs.princeton.edu/~appel/vc/Verif_reverse.html#lab32</link><dc:creator>mkf</dc:creator><dc:date>2020-01-25T05:10:09+01:00</dc:date><dc:subject>VST VST.floyd.proofauto c coq formalmethods verifiable_c </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;linked to me from https://twitter.com/cattheory/status/1220803662802489344 (by Joomy Korkut, PhD student in programming languages at Princeton https://cs.princeton.edu/~ckorkut/) — « not a language but a way to reason about C programs in Coq: VST lets you define separation logic predicates that describe how a Coq type would be represented in C: https://cs.princeton.edu/~appel/vc/Verif_reverse.html#lab32 \n\n might be interesting to you, or not, I don&amp;#039;t know. » at 9:20 PM CET on Jan 24, 2020&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/VST"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/VST.floyd.proofauto"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/c"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/coq"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/formalmethods"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/verifiable_c"/></rdf:Bag></taxo:topics></item></rdf:RDF>