{
"result":{
"query":":facetid:stream:\"streams/journals/afp\"",
"status":{
"@code":"200",
"text":"OK"
},
"time":{
"@unit":"msecs",
"text":"161.95"
},
"completions":{
"@total":"1",
"@computed":"1",
"@sent":"1",
"c":{
"@sc":"639",
"@dc":"639",
"@oc":"639",
"@id":"35224951",
"text":":facetid:stream:streams/journals/afp"
}
},
"hits":{
"@total":"639",
"@computed":"639",
"@sent":"639",
"@first":"0",
"hit":[{
"@score":"1",
"@id":"30478",
"info":{"authors":{"author":{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"}},"title":"Relational Forests.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Journal Articles","access":"open","key":"journals/afp/Guttmann21","ee":"https://www.isa-afp.org/entries/Relational_Forests.html","url":"https://dblp.org/rec/journals/afp/Guttmann21"},
"url":"URL#30478"
},
{
"@score":"1",
"@id":"326883",
"info":{"authors":{"author":[{"@pid":"309/0681","text":"Thomas Ammer"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"van Emde Boas Trees.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/AmmerL21","ee":"https://www.isa-afp.org/entries/Van_Emde_Boas_Trees.html","url":"https://dblp.org/rec/journals/afp/AmmerL21"},
"url":"URL#326883"
},
{
"@score":"1",
"@id":"326884",
"info":{"authors":{"author":[{"@pid":"78/7015","text":"Jesús Aransay"},{"@pid":"309/1101","text":"Alejandro del Campo"},{"@pid":"147/1118","text":"Julius Michaelis"}]},"title":"Simplicial Complexes and Boolean functions.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/AransayCM21","ee":"https://www.isa-afp.org/entries/Simplicial_complexes_and_boolean_functions.html","url":"https://dblp.org/rec/journals/afp/AransayCM21"},
"url":"URL#326884"
},
{
"@score":"1",
"@id":"326885",
"info":{"authors":{"author":[{"@pid":"95/8429","text":"Thomas Bauereiss"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"}]},"title":"Compositional BD Security.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/BauereissP21","ee":"https://www.isa-afp.org/entries/BD_Security_Compositional.html","url":"https://dblp.org/rec/journals/afp/BauereissP21"},
"url":"URL#326885"
},
{
"@score":"1",
"@id":"326886",
"info":{"authors":{"author":[{"@pid":"95/8429","text":"Thomas Bauereiss"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"}]},"title":"CoSMeDis - A confidentiality-verified distributed social media platform.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/BauereissP21a","ee":"https://www.isa-afp.org/entries/CoSMeDis.html","url":"https://dblp.org/rec/journals/afp/BauereissP21a"},
"url":"URL#326886"
},
{
"@score":"1",
"@id":"326887",
"info":{"authors":{"author":[{"@pid":"95/8429","text":"Thomas Bauereiss"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"}]},"title":"CoSMed - A confidentiality-verified social media platform.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/BauereissP21b","ee":"https://www.isa-afp.org/entries/CoSMed.html","url":"https://dblp.org/rec/journals/afp/BauereissP21b"},
"url":"URL#326887"
},
{
"@score":"1",
"@id":"326888",
"info":{"authors":{"author":{"@pid":"b/CBenzmueller","text":"Christoph Benzmüller"}},"title":"Exploring Simplified Variants of Gödel's Ontological Argument in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Benzmuller21","ee":"https://www.isa-afp.org/entries/SimplifiedOntologicalArgument.html","url":"https://dblp.org/rec/journals/afp/Benzmuller21"},
"url":"URL#326888"
},
{
"@score":"1",
"@id":"326889",
"info":{"authors":{"author":[{"@pid":"b/CBenzmueller","text":"Christoph Benzmüller"},{"@pid":"276/0136","text":"Sebastian Reiche"}]},"title":"Automating Public Announcement Logic and the Wise Men Puzzle in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/BenzmullerR21","ee":"https://www.isa-afp.org/entries/PAL.html","url":"https://dblp.org/rec/journals/afp/BenzmullerR21"},
"url":"URL#326889"
},
{
"@score":"1",
"@id":"326890",
"info":{"authors":{"author":{"@pid":"206/0137","text":"Ben Blumson"}},"title":"Mereology.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Blumson21","ee":"https://www.isa-afp.org/entries/Mereology.html","url":"https://dblp.org/rec/journals/afp/Blumson21"},
"url":"URL#326890"
},
{
"@score":"1",
"@id":"326891",
"info":{"authors":{"author":[{"@pid":"207/8104","text":"Anthony Bordg"},{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"},{"@pid":"132/9868","text":"Wenda Li"}]},"title":"Grothendieck's Schemes in Algebraic Geometry.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/BordgPL21","ee":"https://www.isa-afp.org/entries/Grothendieck_Schemes.html","url":"https://dblp.org/rec/journals/afp/BordgPL21"},
"url":"URL#326891"
},
{
"@score":"1",
"@id":"326892",
"info":{"authors":{"author":[{"@pid":"166/6269","text":"Ralph Bottesch"},{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Two algorithms based on modular arithmetic - lattice basis reduction and Hermite normal form computation.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/BotteschDT21","ee":"https://www.isa-afp.org/entries/Modular_arithmetic_LLL_and_HNF_algorithms.html","url":"https://dblp.org/rec/journals/afp/BotteschDT21"},
"url":"URL#326892"
},
{
"@score":"1",
"@id":"326893",
"info":{"authors":{"author":[{"@pid":"53/3541-2","text":"Matthias Brun 0002"},{"@pid":"232/9960","text":"Sára Decova"},{"@pid":"181/5922","text":"Andrea Lattuada"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Formalization of Timely Dataflow's Progress Tracking Protocol.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/BrunDLT21","ee":"https://www.isa-afp.org/entries/Progress_Tracking.html","url":"https://dblp.org/rec/journals/afp/BrunDLT21"},
"url":"URL#326893"
},
{
"@score":"1",
"@id":"326894",
"info":{"authors":{"author":[{"@pid":"204/7454","text":"José Manuel Rodríguez Caballero"},{"@pid":"u/DominiqueUnruh","text":"Dominique Unruh"}]},"title":"Complex Bounded Operators.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/CaballeroU21","ee":"https://www.isa-afp.org/entries/Complex_Bounded_Operators.html","url":"https://dblp.org/rec/journals/afp/CaballeroU21"},
"url":"URL#326894"
},
{
"@score":"1",
"@id":"326895",
"info":{"authors":{"author":{"@pid":"147/9310","text":"Roland Coghetto"}},"title":"Tarski's Parallel Postulate implies the 5th Postulate of Euclid, the Postulate of Playfair and the original Parallel Postulate of Euclid.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Coghetto21","ee":"https://www.isa-afp.org/entries/IsaGeoCoq.html","url":"https://dblp.org/rec/journals/afp/Coghetto21"},
"url":"URL#326895"
},
{
"@score":"1",
"@id":"326896",
"info":{"authors":{"author":[{"@pid":"241/7043","text":"Katherine Cordwell"},{"@pid":"156/7492","text":"Yong Kiam Tan"},{"@pid":"55/950","text":"André Platzer"}]},"title":"The BKR Decision Procedure for Univariate Real Arithmetic.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/CordwellTP21","ee":"https://www.isa-afp.org/entries/BenOr_Kozen_Reif.html","url":"https://dblp.org/rec/journals/afp/CordwellTP21"},
"url":"URL#326896"
},
{
"@score":"1",
"@id":"326897",
"info":{"authors":{"author":[{"@pid":"309/0877","text":"Marie Cousin"},{"@pid":"24/2264","text":"Mnacho Echenim"},{"@pid":"223/9909","text":"Hervé Guiol"}]},"title":"The Hahn and Jordan Decomposition Theorems.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/CousinEG21","ee":"https://www.isa-afp.org/entries/Hahn_Jordan_Decomposition.html","url":"https://dblp.org/rec/journals/afp/CousinEG21"},
"url":"URL#326897"
},
{
"@score":"1",
"@id":"326898",
"info":{"authors":{"author":{"@pid":"294/8506","text":"Aaron Crighton"}},"title":"Hensel's Lemma for the p-adic Integers.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Crighton21","ee":"https://www.isa-afp.org/entries/Padic_Ints.html","url":"https://dblp.org/rec/journals/afp/Crighton21"},
"url":"URL#326898"
},
{
"@score":"1",
"@id":"326899",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Laws of Large Numbers.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl21","ee":"https://www.isa-afp.org/entries/Laws_of_Large_Numbers.html","url":"https://dblp.org/rec/journals/afp/Eberl21"},
"url":"URL#326899"
},
{
"@score":"1",
"@id":"326900",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Formal Puiseux Series.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl21a","ee":"https://www.isa-afp.org/entries/Formal_Puiseux_Series.html","url":"https://dblp.org/rec/journals/afp/Eberl21a"},
"url":"URL#326900"
},
{
"@score":"1",
"@id":"326901",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Hermite-Lindemann-Weierstraß Transcendence Theorem.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl21b","ee":"https://www.isa-afp.org/entries/Hermite_Lindemann.html","url":"https://dblp.org/rec/journals/afp/Eberl21b"},
"url":"URL#326901"
},
{
"@score":"1",
"@id":"326902",
"info":{"authors":{"author":[{"@pid":"139/6835","text":"Manuel Eberl"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Factorization of Polynomials with Algebraic Coefficients.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/EberlT21","ee":"https://www.isa-afp.org/entries/Factor_Algebraic_Polynomial.html","url":"https://dblp.org/rec/journals/afp/EberlT21"},
"url":"URL#326902"
},
{
"@score":"1",
"@id":"326903",
"info":{"authors":{"author":{"@pid":"24/2264","text":"Mnacho Echenim"}},"title":"Quantum projective measurements and the CHSH inequality.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Echenim21","ee":"https://www.isa-afp.org/entries/Projective_Measurements.html","url":"https://dblp.org/rec/journals/afp/Echenim21"},
"url":"URL#326903"
},
{
"@score":"1",
"@id":"326904",
"info":{"authors":{"author":[{"@pid":"264/4019","text":"Chelsea Edmonds"},{"@pid":"220/2813","text":"Angeliki Koutsoukou-Argyraki"},{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}]},"title":"Szemerédi's Regularity Lemma.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/EdmondsKP21","ee":"https://www.isa-afp.org/entries/Szemeredi_Regularity.html","url":"https://dblp.org/rec/journals/afp/EdmondsKP21"},
"url":"URL#326904"
},
{
"@score":"1",
"@id":"326905",
"info":{"authors":{"author":[{"@pid":"264/4019","text":"Chelsea Edmonds"},{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}]},"title":"Combinatorial Design Theory.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/EdmondsP21","ee":"https://www.isa-afp.org/entries/Design_Theory.html","url":"https://dblp.org/rec/journals/afp/EdmondsP21"},
"url":"URL#326905"
},
{
"@score":"1",
"@id":"326906",
"info":{"authors":{"author":{"@pid":"18/4206","text":"Jacques D. Fleuriot"}},"title":"Real Exponents as the Limits of Sequences of Rational Exponents.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Fleuriot21","ee":"https://www.isa-afp.org/entries/Real_Power.html","url":"https://dblp.org/rec/journals/afp/Fleuriot21"},
"url":"URL#326906"
},
{
"@score":"1",
"@id":"326907",
"info":{"authors":{"author":[{"@pid":"306/7824","text":"Valentin Fouillard"},{"@pid":"92/2595","text":"Safouan Taha"},{"@pid":"52/5245","text":"Frédéric Boulanger"},{"@pid":"73/6910","text":"Nicolas Sabouret"}]},"title":"Belief Revision Theory.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/FouillardTBS21","ee":"https://www.isa-afp.org/entries/Belief_Revision.html","url":"https://dblp.org/rec/journals/afp/FouillardTBS21"},
"url":"URL#326907"
},
{
"@score":"1",
"@id":"326908",
"info":{"authors":{"author":{"@pid":"214/1791","text":"Asta Halkjær From"}},"title":"Public Announcement Logic.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/From21","ee":"https://www.isa-afp.org/entries/Public_Announcement_Logic.html","url":"https://dblp.org/rec/journals/afp/From21"},
"url":"URL#326908"
},
{
"@score":"1",
"@id":"326909",
"info":{"authors":{"author":{"@pid":"214/1791","text":"Asta Halkjær From"}},"title":"Soundness and Completeness of an Axiomatic System for First-Order Logic.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/From21a","ee":"https://www.isa-afp.org/entries/FOL_Axiomatic.html","url":"https://dblp.org/rec/journals/afp/From21a"},
"url":"URL#326909"
},
{
"@score":"1",
"@id":"326910",
"info":{"authors":{"author":{"@pid":"280/4846","text":"Alejandro Gómez-Londoño"}},"title":"Hood-Melville Queue.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Gomez-Londono21","ee":"https://www.isa-afp.org/entries/Hood_Melville_Queue.html","url":"https://dblp.org/rec/journals/afp/Gomez-Londono21"},
"url":"URL#326910"
},
{
"@score":"1",
"@id":"326911",
"info":{"authors":{"author":{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"}},"title":"Algebras for Iteration, Infinite Executions and Correctness of Sequential Computations.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Guttmann21a","ee":"https://www.isa-afp.org/entries/Correctness_Algebras.html","url":"https://dblp.org/rec/journals/afp/Guttmann21a"},
"url":"URL#326911"
},
{
"@score":"1",
"@id":"326912",
"info":{"authors":{"author":[{"@pid":"h/StepanHolub","text":"Stepan Holub"},{"@pid":"290/8887","text":"Martin Raska"},{"@pid":"68/7551","text":"Stepán Starosta"}]},"title":"Combinatorics on Words Basics.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/HolubRS21","ee":"https://www.isa-afp.org/entries/Combinatorics_Words.html","url":"https://dblp.org/rec/journals/afp/HolubRS21"},
"url":"URL#326912"
},
{
"@score":"1",
"@id":"326913",
"info":{"authors":{"author":[{"@pid":"h/StepanHolub","text":"Stepan Holub"},{"@pid":"68/7551","text":"Stepán Starosta"}]},"title":"Graph Lemma.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/HolubS21","ee":"https://www.isa-afp.org/entries/Combinatorics_Words_Graph_Lemma.html","url":"https://dblp.org/rec/journals/afp/HolubS21"},
"url":"URL#326913"
},
{
"@score":"1",
"@id":"326914",
"info":{"authors":{"author":[{"@pid":"h/StepanHolub","text":"Stepan Holub"},{"@pid":"68/7551","text":"Stepán Starosta"}]},"title":"Lyndon words.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/HolubS21a","ee":"https://www.isa-afp.org/entries/Combinatorics_Words_Lyndon.html","url":"https://dblp.org/rec/journals/afp/HolubS21a"},
"url":"URL#326914"
},
{
"@score":"1",
"@id":"326915",
"info":{"authors":{"author":{"@pid":"309/1054","text":"Fumiya Iwama"}},"title":"Foundation of geometry in planes, and some complements - Excluding the parallel axioms.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Iwama21","ee":"https://www.isa-afp.org/entries/Foundation_of_geometry.html","url":"https://dblp.org/rec/journals/afp/Iwama21"},
"url":"URL#326915"
},
{
"@score":"1",
"@id":"326916",
"info":{"authors":{"author":{"@pid":"06/4489","text":"Nan Jiang"}},"title":"A data flow analysis algorithm for computing dominators.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Jiang21","ee":"https://www.isa-afp.org/entries/Dominance_CHK.html","url":"https://dblp.org/rec/journals/afp/Jiang21"},
"url":"URL#326916"
},
{
"@score":"1",
"@id":"326917",
"info":{"authors":{"author":{"@pid":"129/1473","text":"Sebastiaan J. C. Joosten"}},"title":"Gale-Stewart Games.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Joosten21","ee":"https://www.isa-afp.org/entries/GaleStewart_Games.html","url":"https://dblp.org/rec/journals/afp/Joosten21"},
"url":"URL#326917"
},
{
"@score":"1",
"@id":"326918",
"info":{"authors":{"author":{"@pid":"288/1537","text":"Jakub Kadziolka"}},"title":"Solution to the xkcd Blue Eyes puzzle.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Kadziolka21","ee":"https://www.isa-afp.org/entries/Blue_Eyes.html","url":"https://dblp.org/rec/journals/afp/Kadziolka21"},
"url":"URL#326918"
},
{
"@score":"1",
"@id":"326919",
"info":{"authors":{"author":{"@pid":"288/1537","text":"Jakub Kadziolka"}},"title":"Lifting the Exponent.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Kadziolka21a","ee":"https://www.isa-afp.org/entries/Lifting_the_Exponent.html","url":"https://dblp.org/rec/journals/afp/Kadziolka21a"},
"url":"URL#326919"
},
{
"@score":"1",
"@id":"326920",
"info":{"authors":{"author":[{"@pid":"254/0857","text":"Kevin Kappelmann"},{"@pid":"36/4781","text":"Lukas Bulwahn"},{"@pid":"297/1046","text":"Sebastian Willenbrink"}]},"title":"SpecCheck - Specification-Based Testing for Isabelle/ML.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/KappelmannBW21","ee":"https://www.isa-afp.org/entries/SpecCheck.html","url":"https://dblp.org/rec/journals/afp/KappelmannBW21"},
"url":"URL#326920"
},
{
"@score":"1",
"@id":"326921",
"info":{"authors":{"author":[{"@pid":"296/9902","text":"Katharina Kreuzer"},{"@pid":"139/6835","text":"Manuel Eberl"}]},"title":"Van der Waerden's Theorem.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/KreuzerE21","ee":"https://www.isa-afp.org/entries/Van_der_Waerden.html","url":"https://dblp.org/rec/journals/afp/KreuzerE21"},
"url":"URL#326921"
},
{
"@score":"1",
"@id":"326922",
"info":{"authors":{"author":[{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"183/9400","text":"S. Reza Sefidgar"}]},"title":"Constructive Cryptography in HOL - the Communication Modeling Aspect.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/LochbihlerS21","ee":"https://www.isa-afp.org/entries/Constructive_Cryptography_CM.html","url":"https://dblp.org/rec/journals/afp/LochbihlerS21"},
"url":"URL#326922"
},
{
"@score":"1",
"@id":"326923",
"info":{"authors":{"author":{"@pid":"232/5289","text":"Susannah Mansky"}},"title":"JinjaDCI - a Java semantics with dynamic class initialization.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Mansky21","ee":"https://www.isa-afp.org/entries/JinjaDCI.html","url":"https://dblp.org/rec/journals/afp/Mansky21"},
"url":"URL#326923"
},
{
"@score":"1",
"@id":"326924",
"info":{"authors":{"author":{"@pid":"232/5289","text":"Susannah Mansky"}},"title":"Regression Test Selection.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Mansky21a","ee":"https://www.isa-afp.org/entries/Regression_Test_Selection.html","url":"https://dblp.org/rec/journals/afp/Mansky21a"},
"url":"URL#326924"
},
{
"@score":"1",
"@id":"326925",
"info":{"authors":{"author":{"@pid":"301/7545","text":"Mihails Milehins"}},"title":"Category Theory for ZFC in HOL II - Elementary Theory of 1-Categories.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Milehins21","ee":"https://www.isa-afp.org/entries/CZH_Elementary_Categories.html","url":"https://dblp.org/rec/journals/afp/Milehins21"},
"url":"URL#326925"
},
{
"@score":"1",
"@id":"326926",
"info":{"authors":{"author":{"@pid":"301/7545","text":"Mihails Milehins"}},"title":"Category Theory for ZFC in HOL I - Foundations - Design Patterns, Set Theory, Digraphs, Semicategories.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Milehins21a","ee":"https://www.isa-afp.org/entries/CZH_Foundations.html","url":"https://dblp.org/rec/journals/afp/Milehins21a"},
"url":"URL#326926"
},
{
"@score":"1",
"@id":"326927",
"info":{"authors":{"author":{"@pid":"301/7545","text":"Mihails Milehins"}},"title":"Category Theory for ZFC in HOL III - Universal Constructions.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Milehins21b","ee":"https://www.isa-afp.org/entries/CZH_Universal_Constructions.html","url":"https://dblp.org/rec/journals/afp/Milehins21b"},
"url":"URL#326927"
},
{
"@score":"1",
"@id":"326928",
"info":{"authors":{"author":{"@pid":"301/7545","text":"Mihails Milehins"}},"title":"Conditional Simplification.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Milehins21c","ee":"https://www.isa-afp.org/entries/Conditional_Simplification.html","url":"https://dblp.org/rec/journals/afp/Milehins21c"},
"url":"URL#326928"
},
{
"@score":"1",
"@id":"326929",
"info":{"authors":{"author":{"@pid":"301/7545","text":"Mihails Milehins"}},"title":"Conditional Transfer Rule.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Milehins21d","ee":"https://www.isa-afp.org/entries/Conditional_Transfer_Rule.html","url":"https://dblp.org/rec/journals/afp/Milehins21d"},
"url":"URL#326929"
},
{
"@score":"1",
"@id":"326930",
"info":{"authors":{"author":{"@pid":"301/7545","text":"Mihails Milehins"}},"title":"IDE - Introduction, Destruction, Elimination.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Milehins21e","ee":"https://www.isa-afp.org/entries/Intro_Dest_Elim.html","url":"https://dblp.org/rec/journals/afp/Milehins21e"},
"url":"URL#326930"
},
{
"@score":"1",
"@id":"326931",
"info":{"authors":{"author":{"@pid":"301/7545","text":"Mihails Milehins"}},"title":"Extension of Types-To-Sets.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Milehins21f","ee":"https://www.isa-afp.org/entries/Types_To_Sets_Extension.html","url":"https://dblp.org/rec/journals/afp/Milehins21f"},
"url":"URL#326931"
},
{
"@score":"1",
"@id":"326932",
"info":{"authors":{"author":{"@pid":"245/7560","text":"Niels Mündler"}},"title":"A Verified Imperative Implementation of B-Trees.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Mundler21","ee":"https://www.isa-afp.org/entries/BTree.html","url":"https://dblp.org/rec/journals/afp/Mundler21"},
"url":"URL#326932"
},
{
"@score":"1",
"@id":"326933",
"info":{"authors":{"author":[{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"},{"@pid":"291/3631","text":"Simon Roßkopf"}]},"title":"Isabelle's Metalogic - Formalization and Proof Checker.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/NipkowR21","ee":"https://www.isa-afp.org/entries/Metalogic_ProofChecker.html","url":"https://dblp.org/rec/journals/afp/NipkowR21"},
"url":"URL#326933"
},
{
"@score":"1",
"@id":"326934",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"A Shorter Compiler Correctness Proof for Language IMP.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce21","ee":"https://www.isa-afp.org/entries/IMP_Compiler.html","url":"https://dblp.org/rec/journals/afp/Noce21"},
"url":"URL#326934"
},
{
"@score":"1",
"@id":"326935",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"Logging-independent Message Anonymity in the Relational Method.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce21a","ee":"https://www.isa-afp.org/entries/Logging_Independent_Anonymity.html","url":"https://dblp.org/rec/journals/afp/Noce21a"},
"url":"URL#326935"
},
{
"@score":"1",
"@id":"326936",
"info":{"authors":{"author":{"@pid":"52/11066","text":"Benedikt Nordhoff"}},"title":"Information Flow Control via Dependency Tracking.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Nordhoff21","ee":"https://www.isa-afp.org/entries/IFC_Tracking.html","url":"https://dblp.org/rec/journals/afp/Nordhoff21"},
"url":"URL#326936"
},
{
"@score":"1",
"@id":"326937",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/8429","text":"Thomas Bauereiss"}]},"title":"Fresh identifiers.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuB21","ee":"https://www.isa-afp.org/entries/Fresh_Identifiers.html","url":"https://dblp.org/rec/journals/afp/PopescuB21"},
"url":"URL#326937"
},
{
"@score":"1",
"@id":"326938",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"95/8429","text":"Thomas Bauereiss"}]},"title":"CoCon - A Confidentiality-Verified Conference Management System.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuLB21","ee":"https://www.isa-afp.org/entries/CoCon.html","url":"https://dblp.org/rec/journals/afp/PopescuLB21"},
"url":"URL#326938"
},
{
"@score":"1",
"@id":"326939",
"info":{"authors":{"author":[{"@pid":"293/9412","text":"Matias Scharager"},{"@pid":"241/7043","text":"Katherine Cordwell"},{"@pid":"61/5931","text":"Stefan Mitsch"},{"@pid":"55/950","text":"André Platzer"}]},"title":"Verified Quadratic Virtual Substitution for Real Arithmetic.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/ScharagerCMP21","ee":"https://www.isa-afp.org/entries/Virtual_Substitution.html","url":"https://dblp.org/rec/journals/afp/ScharagerCMP21"},
"url":"URL#326939"
},
{
"@score":"1",
"@id":"326940",
"info":{"authors":{"author":[{"@pid":"300/3991","text":"Richard Schmoetten"},{"@pid":"300/4373","text":"Jake E. Palmer"},{"@pid":"18/4206","text":"Jacques D. Fleuriot"}]},"title":"Schutz' Independent Axioms for Minkowski Spacetime.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/SchmoettenPF21","ee":"https://www.isa-afp.org/entries/Schutz_Spacetime.html","url":"https://dblp.org/rec/journals/afp/SchmoettenPF21"},
"url":"URL#326940"
},
{
"@score":"1",
"@id":"326941",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"A Formalization of Weighted Path Orders and Recursive Path Orders.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelTY21","ee":"https://www.isa-afp.org/entries/Weighted_Path_Order.html","url":"https://dblp.org/rec/journals/afp/SternagelTY21"},
"url":"URL#326941"
},
{
"@score":"1",
"@id":"326942",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"The Sunflower Lemma of Erdős and Rado.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann21","ee":"https://www.isa-afp.org/entries/Sunflowers.html","url":"https://dblp.org/rec/journals/afp/Thiemann21"},
"url":"URL#326942"
},
{
"@score":"1",
"@id":"326943",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"Solving Cubic and Quartic Equations.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann21a","ee":"https://www.isa-afp.org/entries/Cubic_Quartic_Equations.html","url":"https://dblp.org/rec/journals/afp/Thiemann21a"},
"url":"URL#326943"
},
{
"@score":"1",
"@id":"326944",
"info":{"authors":{"author":[{"@pid":"297/0390","text":"Joseph Thommes"},{"@pid":"139/6835","text":"Manuel Eberl"}]},"title":"Finitely Generated Abelian Groups.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/ThommesE21","ee":"https://www.isa-afp.org/entries/Finitely_Generated_Abelian_Groups.html","url":"https://dblp.org/rec/journals/afp/ThommesE21"},
"url":"URL#326944"
},
{
"@score":"1",
"@id":"326945",
"info":{"authors":{"author":[{"@pid":"301/7483","text":"Fox Thomson"},{"@pid":"132/9868","text":"Wenda Li"}]},"title":"The Theorem of Three Circles.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/ThomsonL21","ee":"https://www.isa-afp.org/entries/Three_Circles.html","url":"https://dblp.org/rec/journals/afp/ThomsonL21"},
"url":"URL#326945"
},
{
"@score":"1",
"@id":"326946",
"info":{"authors":{"author":{"@pid":"u/DominiqueUnruh","text":"Dominique Unruh"}},"title":"Quantum and Classical Registers.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Unruh21","ee":"https://www.isa-afp.org/entries/Registers.html","url":"https://dblp.org/rec/journals/afp/Unruh21"},
"url":"URL#326946"
},
{
"@score":"1",
"@id":"326947",
"info":{"authors":{"author":[{"@pid":"01/8190","text":"Freek Verbeek"},{"@pid":"249/9520","text":"Abhijith Bharadwaj"},{"@pid":"248/0695","text":"Joshua A. Bockenek"},{"@pid":"232/5233","text":"Ian Roessle"},{"@pid":"206/6666","text":"Timmy Weerwag"},{"@pid":"61/2985","text":"Binoy Ravindran"}]},"title":"X86 instruction semantics and basic block symbolic execution.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/VerbeekBBRWR21","ee":"https://www.isa-afp.org/entries/X86_Semantics.html","url":"https://dblp.org/rec/journals/afp/VerbeekBBRWR21"},
"url":"URL#326947"
},
{
"@score":"1",
"@id":"326948",
"info":{"authors":{"author":{"@pid":"233/0114","text":"Mark Wassell"}},"title":"MiniSail - A kernel language for the ISA specification language SAIL.","venue":"Arch. Formal Proofs","volume":"2021","year":"2021","type":"Data and Artifacts","access":"open","key":"journals/afp/Wassell21","ee":"https://www.isa-afp.org/entries/MiniSail.html","url":"https://dblp.org/rec/journals/afp/Wassell21"},
"url":"URL#326948"
},
{
"@score":"1",
"@id":"751951",
"info":{"authors":{"author":[{"@pid":"159/2755","text":"Mohammad Abdulaziz"},{"@pid":"228/5055","text":"Friedrich Kurz"}]},"title":"Verified SAT-Based AI Planning.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/AbdulazizK20","ee":"https://www.isa-afp.org/entries/Verified_SAT_Based_AI_Planning.html","url":"https://dblp.org/rec/journals/afp/AbdulazizK20"},
"url":"URL#751951"
},
{
"@score":"1",
"@id":"751952",
"info":{"authors":{"author":[{"@pid":"159/2755","text":"Mohammad Abdulaziz"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"AI Planning Languages Semantics.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/AbdulazizL20","ee":"https://www.isa-afp.org/entries/AI_Planning_Languages_Semantics.html","url":"https://dblp.org/rec/journals/afp/AbdulazizL20"},
"url":"URL#751952"
},
{
"@score":"1",
"@id":"751953",
"info":{"authors":{"author":{"@pid":"220/2813","text":"Angeliki Koutsoukou-Argyraki"}},"title":"Amicable Numbers.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Argyraki20","ee":"https://www.isa-afp.org/entries/Amicable_Numbers.html","url":"https://dblp.org/rec/journals/afp/Argyraki20"},
"url":"URL#751953"
},
{
"@score":"1",
"@id":"751954",
"info":{"authors":{"author":[{"@pid":"220/2813","text":"Angeliki Koutsoukou-Argyraki"},{"@pid":"132/9868","text":"Wenda Li"}]},"title":"Irrationality Criteria for Series by Erdős and Straus.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/ArgyrakiL20","ee":"https://www.isa-afp.org/entries/Irrational_Series_Erdos_Straus.html","url":"https://dblp.org/rec/journals/afp/ArgyrakiL20"},
"url":"URL#751954"
},
{
"@score":"1",
"@id":"751955",
"info":{"authors":{"author":{"@pid":"20/4604","text":"Frank J. Balbach"}},"title":"Some classical results in inductive inference of recursive functions.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Balbach20","ee":"https://www.isa-afp.org/entries/Inductive_Inference.html","url":"https://dblp.org/rec/journals/afp/Balbach20"},
"url":"URL#751955"
},
{
"@score":"1",
"@id":"751956",
"info":{"authors":{"author":[{"@pid":"52/6913","text":"Jasmin Blanchette"},{"@pid":"133/1986","text":"Sophie Tourret"}]},"title":"Extensions to the Comprehensive Framework for Saturation Theorem Proving.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/BlanchetteT20","ee":"https://www.isa-afp.org/entries/Saturation_Framework_Extensions.html","url":"https://dblp.org/rec/journals/afp/BlanchetteT20"},
"url":"URL#751956"
},
{
"@score":"1",
"@id":"751957",
"info":{"authors":{"author":[{"@pid":"207/8104","text":"Anthony Bordg"},{"@pid":"270/6060","text":"Hanna Lachnitt"},{"@pid":"56/6512","text":"Yijun He"}]},"title":"Isabelle Marries Dirac - a Library for Quantum Computation and Quantum Information.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/BordgLH20","ee":"https://www.isa-afp.org/entries/Isabelle_Marries_Dirac.html","url":"https://dblp.org/rec/journals/afp/BordgLH20"},
"url":"URL#751957"
},
{
"@score":"1",
"@id":"751958",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"150/9083","text":"Michael Herzberg"}]},"title":"The Safely Composable DOM.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerH20","ee":"https://www.isa-afp.org/entries/Core_SC_DOM.html","url":"https://dblp.org/rec/journals/afp/BruckerH20"},
"url":"URL#751958"
},
{
"@score":"1",
"@id":"751959",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"150/9083","text":"Michael Herzberg"}]},"title":"A Formalization of Safely Composable Web Components.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerH20a","ee":"https://www.isa-afp.org/entries/SC_DOM_Components.html","url":"https://dblp.org/rec/journals/afp/BruckerH20a"},
"url":"URL#751959"
},
{
"@score":"1",
"@id":"751960",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"150/9083","text":"Michael Herzberg"}]},"title":"A Formal Model of the Safely Composable Document Object Model with Shadow Roots.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerH20b","ee":"https://www.isa-afp.org/entries/Shadow_SC_DOM.html","url":"https://dblp.org/rec/journals/afp/BruckerH20b"},
"url":"URL#751960"
},
{
"@score":"1",
"@id":"751961",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"150/9083","text":"Michael Herzberg"}]},"title":"A Formalization of Web Components.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerH20c","ee":"https://www.isa-afp.org/entries/DOM_Components.html","url":"https://dblp.org/rec/journals/afp/BruckerH20c"},
"url":"URL#751961"
},
{
"@score":"1",
"@id":"751962",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"150/9083","text":"Michael Herzberg"}]},"title":"A Formal Model of the Document Object Model with Shadow Roots.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerH20d","ee":"https://www.isa-afp.org/entries/Shadow_DOM.html","url":"https://dblp.org/rec/journals/afp/BruckerH20d"},
"url":"URL#751962"
},
{
"@score":"1",
"@id":"751963",
"info":{"authors":{"author":{"@pid":"204/7454","text":"José Manuel Rodríguez Caballero"}},"title":"Arithmetic progressions and relative primes.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Caballero20","ee":"https://www.isa-afp.org/entries/Arith_Prog_Rel_Primes.html","url":"https://dblp.org/rec/journals/afp/Caballero20"},
"url":"URL#751963"
},
{
"@score":"1",
"@id":"751964",
"info":{"authors":{"author":[{"@pid":"222/3614","text":"Thibault Dardinier"},{"@pid":"264/4032","text":"Lukas Heimes"},{"@pid":"204/4402","text":"Martin Raszyk"},{"@pid":"173/4006","text":"Joshua Schneider 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Formalization of an Optimized Monitoring Algorithm for Metric First-Order Dynamic Logic with Aggregations.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/DardinierHRST20","ee":"https://www.isa-afp.org/entries/MFODL_Monitor_Optimized.html","url":"https://dblp.org/rec/journals/afp/DardinierHRST20"},
"url":"URL#751964"
},
{
"@score":"1",
"@id":"751965",
"info":{"authors":{"author":{"@pid":"205/3540","text":"Martin Desharnais"}},"title":"A Generic Framework for Verified Compilers.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Desharnais20","ee":"https://www.isa-afp.org/entries/VeriComp.html","url":"https://dblp.org/rec/journals/afp/Desharnais20"},
"url":"URL#751965"
},
{
"@score":"1",
"@id":"751966",
"info":{"authors":{"author":{"@pid":"205/3540","text":"Martin Desharnais"}},"title":"Inline Caching and Unboxing Optimization for Interpreters.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Desharnais20a","ee":"https://www.isa-afp.org/entries/Interpreter_Optimizations.html","url":"https://dblp.org/rec/journals/afp/Desharnais20a"},
"url":"URL#751966"
},
{
"@score":"1",
"@id":"751967",
"info":{"authors":{"author":{"@pid":"82/6689","text":"Javier Díaz"}},"title":"Finite Map Extras.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Diaz20","ee":"https://www.isa-afp.org/entries/Finite-Map-Extras.html","url":"https://dblp.org/rec/journals/afp/Diaz20"},
"url":"URL#751967"
},
{
"@score":"1",
"@id":"751968",
"info":{"authors":{"author":[{"@pid":"140/7089","text":"Cornelius Diekmann"},{"@pid":"143/3168","text":"Lars Hupel"}]},"title":"Hello World.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/DiekmannH20","ee":"https://www.isa-afp.org/entries/Hello_World.html","url":"https://dblp.org/rec/journals/afp/DiekmannH20"},
"url":"URL#751968"
},
{
"@score":"1",
"@id":"751969",
"info":{"authors":{"author":{"@pid":"124/7624","text":"Jose Divasón"}},"title":"A verified algorithm for computing the Smith normal form of a matrix.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Divason20","ee":"https://www.isa-afp.org/entries/Smith_Normal_Form.html","url":"https://dblp.org/rec/journals/afp/Divason20"},
"url":"URL#751969"
},
{
"@score":"1",
"@id":"751970",
"info":{"authors":{"author":{"@pid":"266/8234","text":"Georgy Dunaev"}},"title":"Recursion Theorem in ZF.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Dunaev20","ee":"https://www.isa-afp.org/entries/Recursion-Addition.html","url":"https://dblp.org/rec/journals/afp/Dunaev20"},
"url":"URL#751970"
},
{
"@score":"1",
"@id":"751971",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Mersenne primes and the Lucas-Lehmer test.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl20","ee":"https://www.isa-afp.org/entries/Mersenne_Primes.html","url":"https://dblp.org/rec/journals/afp/Eberl20"},
"url":"URL#751971"
},
{
"@score":"1",
"@id":"751972",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Furstenberg's topology and his proof of the infinitude of primes.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl20a","ee":"https://www.isa-afp.org/entries/Furstenberg_Topology.html","url":"https://dblp.org/rec/journals/afp/Eberl20a"},
"url":"URL#751972"
},
{
"@score":"1",
"@id":"751973",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Gaussian Integers.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl20b","ee":"https://www.isa-afp.org/entries/Gaussian_Integers.html","url":"https://dblp.org/rec/journals/afp/Eberl20b"},
"url":"URL#751973"
},
{
"@score":"1",
"@id":"751974",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Lambert W Function on the Reals.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl20c","ee":"https://www.isa-afp.org/entries/Lambert_W.html","url":"https://dblp.org/rec/journals/afp/Eberl20c"},
"url":"URL#751974"
},
{
"@score":"1",
"@id":"751975",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Power Sum Polynomials.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl20d","ee":"https://www.isa-afp.org/entries/Power_Sum_Polynomials.html","url":"https://dblp.org/rec/journals/afp/Eberl20d"},
"url":"URL#751975"
},
{
"@score":"1",
"@id":"751976",
"info":{"authors":{"author":{"@pid":"264/4019","text":"Chelsea Edmonds"}},"title":"Lucas's Theorem.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Edmonds20","ee":"https://www.isa-afp.org/entries/Lucas_Theorem.html","url":"https://dblp.org/rec/journals/afp/Edmonds20"},
"url":"URL#751976"
},
{
"@score":"1",
"@id":"751977",
"info":{"authors":{"author":[{"@pid":"257/8810","text":"Robin Eßmann"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"},{"@pid":"145/9554","text":"Simon Robillard"}]},"title":"Verified Approximation Algorithms.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/EssmannNR20","ee":"https://www.isa-afp.org/entries/Approximation_Algorithms.html","url":"https://dblp.org/rec/journals/afp/EssmannNR20"},
"url":"URL#751977"
},
{
"@score":"1",
"@id":"751978",
"info":{"authors":{"author":{"@pid":"72/9638","text":"Bertram Felgenhauer"}},"title":"Implementing the Goodstein Function in λ-Calculus.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Felgenhauer20","ee":"https://www.isa-afp.org/entries/Goodstein_Lambda.html","url":"https://dblp.org/rec/journals/afp/Felgenhauer20"},
"url":"URL#751978"
},
{
"@score":"1",
"@id":"751979",
"info":{"authors":{"author":[{"@pid":"272/0821","text":"Ben Fiedler"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"A Formal Proof of The Chandy-Lamport Distributed Snapshot Algorithm.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/FiedlerT20","ee":"https://www.isa-afp.org/entries/Chandy_Lamport.html","url":"https://dblp.org/rec/journals/afp/FiedlerT20"},
"url":"URL#751979"
},
{
"@score":"1",
"@id":"751980",
"info":{"authors":{"author":[{"@pid":"175/3307","text":"Mathias Fleury"},{"@pid":"208/7313","text":"Daniela Kaufmann"}]},"title":"Practical Algebraic Calculus Checker.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/FleuryK20","ee":"https://www.isa-afp.org/entries/PAC_Checker.html","url":"https://dblp.org/rec/journals/afp/FleuryK20"},
"url":"URL#751980"
},
{
"@score":"1",
"@id":"751981",
"info":{"authors":{"author":[{"@pid":"10/2282-1","text":"Michael Foster 0001"},{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"79/2238","text":"Ramsay G. Taylor"},{"@pid":"78/3015","text":"John Derrick"}]},"title":"Inference of Extended Finite State Machines.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/FosterBTD20","ee":"https://www.isa-afp.org/entries/Extended_Finite_State_Machine_Inference.html","url":"https://dblp.org/rec/journals/afp/FosterBTD20"},
"url":"URL#751981"
},
{
"@score":"1",
"@id":"751982",
"info":{"authors":{"author":[{"@pid":"10/2282-1","text":"Michael Foster 0001"},{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"79/2238","text":"Ramsay G. Taylor"},{"@pid":"78/3015","text":"John Derrick"}]},"title":"A Formal Model of Extended Finite State Machines.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/FosterBTD20a","ee":"https://www.isa-afp.org/entries/Extended_Finite_State_Machines.html","url":"https://dblp.org/rec/journals/afp/FosterBTD20a"},
"url":"URL#751982"
},
{
"@score":"1",
"@id":"751983",
"info":{"authors":{"author":[{"@pid":"14/4971","text":"Simon Foster 0001"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"A Sound Type System for Physical Quantities, Units, and Measurements.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/FosterW20","ee":"https://www.isa-afp.org/entries/Physical_Quantities.html","url":"https://dblp.org/rec/journals/afp/FosterW20"},
"url":"URL#751983"
},
{
"@score":"1",
"@id":"751984",
"info":{"authors":{"author":{"@pid":"199/6154","text":"David Fuenmayor"}},"title":"Topological semantics for paraconsistent and paracomplete logics.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Fuenmayor20","ee":"https://www.isa-afp.org/entries/Topological_Semantics.html","url":"https://dblp.org/rec/journals/afp/Fuenmayor20"},
"url":"URL#751984"
},
{
"@score":"1",
"@id":"751985",
"info":{"authors":{"author":{"@pid":"20/6956","text":"Peter Gammie"}},"title":"Putting the 'K' into Bird's derivation of Knuth-Morris-Pratt string matching.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Gammie20","ee":"https://www.isa-afp.org/entries/BirdKMP.html","url":"https://dblp.org/rec/journals/afp/Gammie20"},
"url":"URL#751985"
},
{
"@score":"1",
"@id":"751986",
"info":{"authors":{"author":[{"@pid":"223/4665","text":"Emmanuel Gunther"},{"@pid":"01/7183","text":"Miguel Pagano"},{"@pid":"46/7604","text":"Pedro Sánchez Terraf"}]},"title":"Formalization of Forcing in Isabelle/ZF.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/GuntherPT20","ee":"https://www.isa-afp.org/entries/Forcing.html","url":"https://dblp.org/rec/journals/afp/GuntherPT20"},
"url":"URL#751986"
},
{
"@score":"1",
"@id":"751987",
"info":{"authors":{"author":{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"}},"title":"Relational Disjoint-Set Forests.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Guttmann20","ee":"https://www.isa-afp.org/entries/Relational_Disjoint_Set_Forests.html","url":"https://dblp.org/rec/journals/afp/Guttmann20"},
"url":"URL#751987"
},
{
"@score":"1",
"@id":"751988",
"info":{"authors":{"author":[{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"},{"@pid":"98/7040","text":"Peter Höfner"}]},"title":"Relational Characterisations of Paths.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/GuttmannH20","ee":"https://www.isa-afp.org/entries/Relational_Paths.html","url":"https://dblp.org/rec/journals/afp/GuttmannH20"},
"url":"URL#751988"
},
{
"@score":"1",
"@id":"751989",
"info":{"authors":{"author":[{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"},{"@pid":"m/BernhardMoller","text":"Bernhard Möller"}]},"title":"A Hierarchy of Algebras for Boolean Subsets.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/GuttmannM20","ee":"https://www.isa-afp.org/entries/Subset_Boolean_Algebras.html","url":"https://dblp.org/rec/journals/afp/GuttmannM20"},
"url":"URL#751989"
},
{
"@score":"1",
"@id":"751990",
"info":{"authors":{"author":[{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"},{"@pid":"280/3992","text":"Nicolas Robinson-O'Brien"}]},"title":"Relational Minimum Spanning Tree Algorithms.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/GuttmannR20","ee":"https://www.isa-afp.org/entries/Relational_Minimum_Spanning_Trees.html","url":"https://dblp.org/rec/journals/afp/GuttmannR20"},
"url":"URL#751990"
},
{
"@score":"1",
"@id":"751991",
"info":{"authors":{"author":[{"@pid":"222/4355","text":"Max W. Haslbeck"},{"@pid":"139/6835","text":"Manuel Eberl"}]},"title":"Skip Lists.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/HaslbeckE20","ee":"https://www.isa-afp.org/entries/Skip_Lists.html","url":"https://dblp.org/rec/journals/afp/HaslbeckE20"},
"url":"URL#751991"
},
{
"@score":"1",
"@id":"751992",
"info":{"authors":{"author":[{"@pid":"264/4032","text":"Lukas Heimes"},{"@pid":"95/10567","text":"Dmitriy Traytel"},{"@pid":"173/4006","text":"Joshua Schneider 0001"}]},"title":"Formalization of an Algorithm for Greedily Computing Associative Aggregations on Sliding Windows.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/HeimesTS20","ee":"https://www.isa-afp.org/entries/Sliding_Window_Algorithm.html","url":"https://dblp.org/rec/journals/afp/HeimesTS20"},
"url":"URL#751992"
},
{
"@score":"1",
"@id":"751993",
"info":{"authors":{"author":[{"@pid":"138/9301","text":"Andreas V. Hess"},{"@pid":"39/5285","text":"Sebastian Mödersheim"},{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"}]},"title":"Stateful Protocol Composition and Typing.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/HessMB20","ee":"https://www.isa-afp.org/entries/Stateful_Protocol_Composition_and_Typing.html","url":"https://dblp.org/rec/journals/afp/HessMB20"},
"url":"URL#751993"
},
{
"@score":"1",
"@id":"751994",
"info":{"authors":{"author":[{"@pid":"138/9301","text":"Andreas V. Hess"},{"@pid":"39/5285","text":"Sebastian Mödersheim"},{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"166/1371","text":"Anders Schlichtkrull"}]},"title":"Automated Stateful Protocol Verification.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/HessMBS20","ee":"https://www.isa-afp.org/entries/Automated_Stateful_Protocol_Verification.html","url":"https://dblp.org/rec/journals/afp/HessMBS20"},
"url":"URL#751994"
},
{
"@score":"1",
"@id":"751995",
"info":{"authors":{"author":{"@pid":"47/6815","text":"Florian Kammueller"}},"title":"Attack Trees in Isabelle for GDPR compliance of IoT healthcare systems.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Kammueller20","ee":"https://www.isa-afp.org/entries/Attack_Trees.html","url":"https://dblp.org/rec/journals/afp/Kammueller20"},
"url":"URL#751995"
},
{
"@score":"1",
"@id":"751996",
"info":{"authors":{"author":[{"@pid":"262/4887","text":"Emin Karayel"},{"@pid":"150/9049","text":"Edgar Gonzàlez"}]},"title":"Strong Eventual Consistency of the Collaborative Editing Framework WOOT.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/KarayelG20","ee":"https://www.isa-afp.org/entries/WOOT_Strong_Eventual_Consistency.html","url":"https://dblp.org/rec/journals/afp/KarayelG20"},
"url":"URL#751996"
},
{
"@score":"1",
"@id":"751997",
"info":{"authors":{"author":[{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"31/6410","text":"Ognjen Maric"}]},"title":"Authenticated Data Structures As Functors.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/LochbihlerM20","ee":"https://www.isa-afp.org/entries/ADS_Functor.html","url":"https://dblp.org/rec/journals/afp/LochbihlerM20"},
"url":"URL#751997"
},
{
"@score":"1",
"@id":"751998",
"info":{"authors":{"author":{"@pid":"228/4496","text":"Jonathan Julián Huerta y Munive"}},"title":"Matrices for ODEs.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Munive20","ee":"https://www.isa-afp.org/entries/Matrices_for_ODEs.html","url":"https://dblp.org/rec/journals/afp/Munive20"},
"url":"URL#751998"
},
{
"@score":"1",
"@id":"751999",
"info":{"authors":{"author":{"@pid":"31/6289","text":"Toby Murray"}},"title":"An Under-Approximate Relational Logic.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Murray20","ee":"https://www.isa-afp.org/entries/Relational-Incorrectness-Logic.html","url":"https://dblp.org/rec/journals/afp/Murray20"},
"url":"URL#751999"
},
{
"@score":"1",
"@id":"752000",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"The Relational Method with Message Anonymity for the Verification of Cryptographic Protocols.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce20","ee":"https://www.isa-afp.org/entries/Relational_Method.html","url":"https://dblp.org/rec/journals/afp/Noce20"},
"url":"URL#752000"
},
{
"@score":"1",
"@id":"752001",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"The Nash-Williams Partition Theorem.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson20","ee":"https://www.isa-afp.org/entries/Nash_Williams.html","url":"https://dblp.org/rec/journals/afp/Paulson20"},
"url":"URL#752001"
},
{
"@score":"1",
"@id":"752002",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"Ordinal Partitions.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson20a","ee":"https://www.isa-afp.org/entries/Ordinal_Partitions.html","url":"https://dblp.org/rec/journals/afp/Paulson20a"},
"url":"URL#752002"
},
{
"@score":"1",
"@id":"752003",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"From Abstract to Concrete Gödel's Incompleteness Theorems - Part I.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuT20","ee":"https://www.isa-afp.org/entries/Goedel_HFSet_Semantic.html","url":"https://dblp.org/rec/journals/afp/PopescuT20"},
"url":"URL#752003"
},
{
"@score":"1",
"@id":"752004",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"From Abstract to Concrete Gödel's Incompleteness Theorems - Part II.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuT20a","ee":"https://www.isa-afp.org/entries/Goedel_HFSet_Semanticless.html","url":"https://dblp.org/rec/journals/afp/PopescuT20a"},
"url":"URL#752004"
},
{
"@score":"1",
"@id":"752005",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"An Abstract Formalization of Gödel's Incompleteness Theorems.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuT20b","ee":"https://www.isa-afp.org/entries/Goedel_Incompleteness.html","url":"https://dblp.org/rec/journals/afp/PopescuT20b"},
"url":"URL#752005"
},
{
"@score":"1",
"@id":"752006",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Robinson Arithmetic.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuT20c","ee":"https://www.isa-afp.org/entries/Robinson_Arithmetic.html","url":"https://dblp.org/rec/journals/afp/PopescuT20c"},
"url":"URL#752006"
},
{
"@score":"1",
"@id":"752007",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Syntax-Independent Logic Infrastructure.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuT20d","ee":"https://www.isa-afp.org/entries/Syntax_Independent_Logic.html","url":"https://dblp.org/rec/journals/afp/PopescuT20d"},
"url":"URL#752007"
},
{
"@score":"1",
"@id":"752008",
"info":{"authors":{"author":[{"@pid":"76/5899","text":"Martin Rau"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Closest Pair of Points Algorithms.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/RauN20","ee":"https://www.isa-afp.org/entries/Closest_Pair_Points.html","url":"https://dblp.org/rec/journals/afp/RauN20"},
"url":"URL#752008"
},
{
"@score":"1",
"@id":"752009",
"info":{"authors":{"author":[{"@pid":"167/3752","text":"Albert Rizaldi"},{"@pid":"47/11065","text":"Fabian Immler"}]},"title":"A Formally Verified Checker of the Safe Distance Traffic Rules for Autonomous Vehicles.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/RizaldiI20","ee":"https://www.isa-afp.org/entries/Safe_Distance.html","url":"https://dblp.org/rec/journals/afp/RizaldiI20"},
"url":"URL#752009"
},
{
"@score":"1",
"@id":"752010",
"info":{"authors":{"author":{"@pid":"129/1369","text":"Salomon Sickert"}},"title":"An Efficient Normalisation Procedure for Linear Temporal Logic - Isabelle/HOL Formalisation.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Sickert20","ee":"https://www.isa-afp.org/entries/LTL_Normal_Form.html","url":"https://dblp.org/rec/journals/afp/Sickert20"},
"url":"URL#752010"
},
{
"@score":"1",
"@id":"752011",
"info":{"authors":{"author":{"@pid":"s/EugeneWStark","text":"Eugene W. Stark"}},"title":"Bicategories.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Stark20","ee":"https://www.isa-afp.org/entries/Bicategory.html","url":"https://dblp.org/rec/journals/afp/Stark20"},
"url":"URL#752011"
},
{
"@score":"1",
"@id":"752012",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"A Formalization of Knuth-Bendix Orders.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT20","ee":"https://www.isa-afp.org/entries/Knuth_Bendix_Order.html","url":"https://dblp.org/rec/journals/afp/SternagelT20"},
"url":"URL#752012"
},
{
"@score":"1",
"@id":"752013",
"info":{"authors":{"author":[{"@pid":"92/2595","text":"Safouan Taha"},{"@pid":"63/5369","text":"Burkhart Wolff"},{"@pid":"17/989","text":"Lina Ye"}]},"title":"The HOL-CSP Refinement Toolkit.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/TahaWY20","ee":"https://www.isa-afp.org/entries/CSP_RefTK.html","url":"https://dblp.org/rec/journals/afp/TahaWY20"},
"url":"URL#752013"
},
{
"@score":"1",
"@id":"752014",
"info":{"authors":{"author":{"@pid":"46/7604","text":"Pedro Sánchez Terraf"}},"title":"Cofinality and the Delta System Lemma.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Terraf20","ee":"https://www.isa-afp.org/entries/Delta_System_Lemma.html","url":"https://dblp.org/rec/journals/afp/Terraf20"},
"url":"URL#752014"
},
{
"@score":"1",
"@id":"752015",
"info":{"authors":{"author":{"@pid":"133/1986","text":"Sophie Tourret"}},"title":"A Comprehensive Framework for Saturation Theorem Proving.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/Tourret20","ee":"https://www.isa-afp.org/entries/Saturation_Framework.html","url":"https://dblp.org/rec/journals/afp/Tourret20"},
"url":"URL#752015"
},
{
"@score":"1",
"@id":"752016",
"info":{"authors":{"author":[{"@pid":"u/DominiqueUnruh","text":"Dominique Unruh"},{"@pid":"204/7454","text":"José Manuel Rodríguez Caballero"}]},"title":"Banach-Steinhaus Theorem.","venue":"Arch. Formal Proofs","volume":"2020","year":"2020","type":"Data and Artifacts","access":"open","key":"journals/afp/UnruhC20","ee":"https://www.isa-afp.org/entries/Banach_Steinhaus.html","url":"https://dblp.org/rec/journals/afp/UnruhC20"},
"url":"URL#752016"
},
{
"@score":"1",
"@id":"1175801",
"info":{"authors":{"author":{"@pid":"220/2813","text":"Angeliki Koutsoukou-Argyraki"}},"title":"Aristotle's Assertoric Syllogistic.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Argyraki19","ee":"https://www.isa-afp.org/entries/Aristotles_Assertoric_Syllogistic.html","url":"https://dblp.org/rec/journals/afp/Argyraki19"},
"url":"URL#1175801"
},
{
"@score":"1",
"@id":"1175802",
"info":{"authors":{"author":[{"@pid":"220/2813","text":"Angeliki Koutsoukou-Argyraki"},{"@pid":"132/9868","text":"Wenda Li"}]},"title":"The Transcendence of Certain Infinite Series.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/ArgyrakiL19","ee":"https://www.isa-afp.org/entries/Transcendence_Series_Hancl_Rucki.html","url":"https://dblp.org/rec/journals/afp/ArgyrakiL19"},
"url":"URL#1175802"
},
{
"@score":"1",
"@id":"1175803",
"info":{"authors":{"author":[{"@pid":"19/6243","text":"David Aspinall 0001"},{"@pid":"40/3555-2","text":"David Butler 0002"}]},"title":"Multi-Party Computation.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/AspinallB19","ee":"https://www.isa-afp.org/entries/Multi_Party_Computation.html","url":"https://dblp.org/rec/journals/afp/AspinallB19"},
"url":"URL#1175803"
},
{
"@score":"1",
"@id":"1175804",
"info":{"authors":{"author":{"@pid":"58/137","text":"Clemens Ballarin"}},"title":"A Case Study in Basic Algebra.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Ballarin19","ee":"https://www.isa-afp.org/entries/Jacobson_Basic_Algebra.html","url":"https://dblp.org/rec/journals/afp/Ballarin19"},
"url":"URL#1175804"
},
{
"@score":"1",
"@id":"1175805",
"info":{"authors":{"author":{"@pid":"192/2258","text":"Brandon Bohrer"}},"title":"Interval Arithmetic on 32-bit Words.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Bohrer19","ee":"https://www.isa-afp.org/entries/Interval_Arithmetic_Word32.html","url":"https://dblp.org/rec/journals/afp/Bohrer19"},
"url":"URL#1175805"
},
{
"@score":"1",
"@id":"1175806",
"info":{"authors":{"author":[{"@pid":"166/6269","text":"Ralph Bottesch"},{"@pid":"222/4355","text":"Max W. Haslbeck"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Farkas' Lemma and Motzkin's Transposition Theorem.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/BotteschHT19","ee":"https://www.isa-afp.org/entries/Farkas.html","url":"https://dblp.org/rec/journals/afp/BotteschHT19"},
"url":"URL#1175806"
},
{
"@score":"1",
"@id":"1175807",
"info":{"authors":{"author":[{"@pid":"166/6269","text":"Ralph Bottesch"},{"@pid":"230/4477","text":"Alban Reynaud"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Linear Inequalities.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/BotteschRT19","ee":"https://www.isa-afp.org/entries/Linear_Inequalities.html","url":"https://dblp.org/rec/journals/afp/BotteschRT19"},
"url":"URL#1175807"
},
{
"@score":"1",
"@id":"1175808",
"info":{"authors":{"author":[{"@pid":"53/3541-2","text":"Matthias Brun 0002"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Formalization of Generic Authenticated Data Structures.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/BrunT19","ee":"https://www.isa-afp.org/entries/LambdaAuth.html","url":"https://dblp.org/rec/journals/afp/BrunT19"},
"url":"URL#1175808"
},
{
"@score":"1",
"@id":"1175809",
"info":{"authors":{"author":[{"@pid":"40/3555-2","text":"David Butler 0002"},{"@pid":"43/1499","text":"Andreas Lochbihler"}]},"title":"Sigma Protocols and Commitment Schemes.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/ButlerL19","ee":"https://www.isa-afp.org/entries/Sigma_Commit_Crypto.html","url":"https://dblp.org/rec/journals/afp/ButlerL19"},
"url":"URL#1175809"
},
{
"@score":"1",
"@id":"1175810",
"info":{"authors":{"author":[{"@pid":"248/3039","text":"Maxime Buyse"},{"@pid":"43/164","text":"Jason Jaskolka"}]},"title":"Communicating Concurrent Kleene Algebra for Distributed Systems Specification.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/BuyseJ19","ee":"https://www.isa-afp.org/entries/C2KA_DistributedSystems.html","url":"https://dblp.org/rec/journals/afp/BuyseJ19"},
"url":"URL#1175810"
},
{
"@score":"1",
"@id":"1175811",
"info":{"authors":{"author":[{"@pid":"84/4905","text":"Ernie Cohen"},{"@pid":"88/7021","text":"Norbert Schirmer"}]},"title":"A Reduction Theorem for Store Buffers.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/CohenS19","ee":"https://www.isa-afp.org/entries/Store_Buffer_Reduction.html","url":"https://dblp.org/rec/journals/afp/CohenS19"},
"url":"URL#1175811"
},
{
"@score":"1",
"@id":"1175812",
"info":{"authors":{"author":{"@pid":"222/3614","text":"Thibault Dardinier"}},"title":"Formalization of Multiway-Join Algorithms.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Dardinier19","ee":"https://www.isa-afp.org/entries/Generic_Join.html","url":"https://dblp.org/rec/journals/afp/Dardinier19"},
"url":"URL#1175812"
},
{
"@score":"1",
"@id":"1175813",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Inversions of a List.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl19","ee":"https://www.isa-afp.org/entries/List_Inversions.html","url":"https://dblp.org/rec/journals/afp/Eberl19"},
"url":"URL#1175813"
},
{
"@score":"1",
"@id":"1175814",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Elementary Facts About the Distribution of Primes.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl19a","ee":"https://www.isa-afp.org/entries/Prime_Distribution_Elementary.html","url":"https://dblp.org/rec/journals/afp/Eberl19a"},
"url":"URL#1175814"
},
{
"@score":"1",
"@id":"1175815",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Selected Problems from the International Mathematical Olympiad 2019.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl19b","ee":"https://www.isa-afp.org/entries/IMO2019.html","url":"https://dblp.org/rec/journals/afp/Eberl19b"},
"url":"URL#1175815"
},
{
"@score":"1",
"@id":"1175816",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Irrationality of ζ(3).","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl19c","ee":"https://www.isa-afp.org/entries/Zeta_3_Irrational.html","url":"https://dblp.org/rec/journals/afp/Eberl19c"},
"url":"URL#1175816"
},
{
"@score":"1",
"@id":"1175817",
"info":{"authors":{"author":[{"@pid":"14/4971","text":"Simon Foster 0001"},{"@pid":"23/6727","text":"Frank Zeyda"},{"@pid":"130/7500","text":"Yakoub Nemouchi"},{"@pid":"184/3701","text":"Pedro Ribeiro 0002"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"Isabelle/UTP - Mechanised Theory Engineering for Unifying Theories of Programming.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/FosterZNRW19","ee":"https://www.isa-afp.org/entries/UTP.html","url":"https://dblp.org/rec/journals/afp/FosterZNRW19"},
"url":"URL#1175817"
},
{
"@score":"1",
"@id":"1175818",
"info":{"authors":{"author":{"@pid":"214/1791","text":"Asta Halkjær From"}},"title":"A Sequent Calculus for First-Order Logic.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/From19","ee":"https://www.isa-afp.org/entries/FOL_Seq_Calc1.html","url":"https://dblp.org/rec/journals/afp/From19"},
"url":"URL#1175818"
},
{
"@score":"1",
"@id":"1175819",
"info":{"authors":{"author":{"@pid":"214/1791","text":"Asta Halkjær From"}},"title":"Formalizing a Seligman-Style Tableau System for Hybrid Logic.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/From19a","ee":"https://www.isa-afp.org/entries/Hybrid_Logic.html","url":"https://dblp.org/rec/journals/afp/From19a"},
"url":"URL#1175819"
},
{
"@score":"1",
"@id":"1175820",
"info":{"authors":{"author":[{"@pid":"203/9177","text":"Lorenzo Gheri"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"}]},"title":"A General Theory of Syntax with Bindings.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/GheriP19","ee":"https://www.isa-afp.org/entries/Binding_Syntax_Theory.html","url":"https://dblp.org/rec/journals/afp/GheriP19"},
"url":"URL#1175820"
},
{
"@score":"1",
"@id":"1175821",
"info":{"authors":{"author":{"@pid":"243/8842","text":"Simon Griebel"}},"title":"Binary Heaps for IMP2.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Griebel19","ee":"https://www.isa-afp.org/entries/IMP2_Binary_Heap.html","url":"https://dblp.org/rec/journals/afp/Griebel19"},
"url":"URL#1175821"
},
{
"@score":"1",
"@id":"1175822",
"info":{"authors":{"author":[{"@pid":"134/6302","text":"Maximilian P. L. Haslbeck"},{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"194/1106","text":"Julian Biendarra"}]},"title":"Kruskal's Algorithm for Minimum Spanning Forest.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/HaslbeckLB19","ee":"https://www.isa-afp.org/entries/Kruskal.html","url":"https://dblp.org/rec/journals/afp/HaslbeckLB19"},
"url":"URL#1175822"
},
{
"@score":"1",
"@id":"1175823",
"info":{"authors":{"author":{"@pid":"143/3168","text":"Lars Hupel"}},"title":"An Algebra for Higher-Order Terms.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Hupel19","ee":"https://www.isa-afp.org/entries/Higher_Order_Terms.html","url":"https://dblp.org/rec/journals/afp/Hupel19"},
"url":"URL#1175823"
},
{
"@score":"1",
"@id":"1175824",
"info":{"authors":{"author":{"@pid":"143/3168","text":"Lars Hupel"}},"title":"A Verified Code Generator from Isabelle/HOL to CakeML.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Hupel19a","ee":"https://www.isa-afp.org/entries/CakeML_Codegen.html","url":"https://dblp.org/rec/journals/afp/Hupel19a"},
"url":"URL#1175824"
},
{
"@score":"1",
"@id":"1175825",
"info":{"authors":{"author":{"@pid":"47/11065","text":"Fabian Immler"}},"title":"Laplace Transform.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Immler19","ee":"https://www.isa-afp.org/entries/Laplace_Transform.html","url":"https://dblp.org/rec/journals/afp/Immler19"},
"url":"URL#1175825"
},
{
"@score":"1",
"@id":"1175826",
"info":{"authors":{"author":[{"@pid":"47/11065","text":"Fabian Immler"},{"@pid":"156/7492","text":"Yong Kiam Tan"}]},"title":"The Poincaré-Bendixson Theorem.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/ImmlerT19","ee":"https://www.isa-afp.org/entries/Poincare_Bendixson.html","url":"https://dblp.org/rec/journals/afp/ImmlerT19"},
"url":"URL#1175826"
},
{
"@score":"1",
"@id":"1175827",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichN19","ee":"https://www.isa-afp.org/entries/Prim_Dijkstra_Simple.html","url":"https://dblp.org/rec/journals/afp/LammichN19"},
"url":"URL#1175827"
},
{
"@score":"1",
"@id":"1175828",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Priority Search Trees.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichN19a","ee":"https://www.isa-afp.org/entries/Priority_Search_Trees.html","url":"https://dblp.org/rec/journals/afp/LammichN19a"},
"url":"URL#1175828"
},
{
"@score":"1",
"@id":"1175829",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"132/9797","text":"Simon Wimmer 0001"}]},"title":"IMP2 - Simple Program Verification in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichW19","ee":"https://www.isa-afp.org/entries/IMP2.html","url":"https://dblp.org/rec/journals/afp/LammichW19"},
"url":"URL#1175829"
},
{
"@score":"1",
"@id":"1175830",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"132/9797","text":"Simon Wimmer 0001"}]},"title":"VerifyThis 2019 - Polished Isabelle Solutions.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichW19a","ee":"https://www.isa-afp.org/entries/VerifyThis2019.html","url":"https://dblp.org/rec/journals/afp/LammichW19a"},
"url":"URL#1175830"
},
{
"@score":"1",
"@id":"1175831",
"info":{"authors":{"author":[{"@pid":"122/7374","text":"Junyi Liu"},{"@pid":"31/11002","text":"Bohua Zhan"},{"@pid":"97/4633","text":"Shuling Wang"},{"@pid":"132/6904","text":"Shenggang Ying"},{"@pid":"43/656","text":"Tao Liu"},{"@pid":"51/10827","text":"Yangjia Li"},{"@pid":"13/6525","text":"Mingsheng Ying"},{"@pid":"63/1911","text":"Naijun Zhan"}]},"title":"Quantum Hoare Logic.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/LiuZWYLLYZ19","ee":"https://www.isa-afp.org/entries/QHLProver.html","url":"https://dblp.org/rec/journals/afp/LiuZWYLLYZ19"},
"url":"URL#1175831"
},
{
"@score":"1",
"@id":"1175832",
"info":{"authors":{"author":{"@pid":"04/11066","text":"Giuliano Losa"}},"title":"Stellar Quorum Systems.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Losa19","ee":"https://www.isa-afp.org/entries/Stellar_Quorums.html","url":"https://dblp.org/rec/journals/afp/Losa19"},
"url":"URL#1175832"
},
{
"@score":"1",
"@id":"1175833",
"info":{"authors":{"author":{"@pid":"149/2436","text":"Alexander Maletzky"}},"title":"Gröbner Bases, Macaulay Matrices and Dubé's Degree Bounds.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Maletzky19","ee":"https://www.isa-afp.org/entries/Groebner_Macaulay.html","url":"https://dblp.org/rec/journals/afp/Maletzky19"},
"url":"URL#1175833"
},
{
"@score":"1",
"@id":"1175834",
"info":{"authors":{"author":{"@pid":"149/2436","text":"Alexander Maletzky"}},"title":"Hilbert's Nullstellensatz.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Maletzky19a","ee":"https://www.isa-afp.org/entries/Nullstellensatz.html","url":"https://dblp.org/rec/journals/afp/Maletzky19a"},
"url":"URL#1175834"
},
{
"@score":"1",
"@id":"1175835",
"info":{"authors":{"author":[{"@pid":"32/881","text":"Filip Maric"},{"@pid":"257/8698","text":"Danijela Simic"}]},"title":"Complex Geometry.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/MaricS19","ee":"https://www.isa-afp.org/entries/Complex_Geometry.html","url":"https://dblp.org/rec/journals/afp/MaricS19"},
"url":"URL#1175835"
},
{
"@score":"1",
"@id":"1175836",
"info":{"authors":{"author":{"@pid":"228/4496","text":"Jonathan Julián Huerta y Munive"}},"title":"Verification Components for Hybrid Systems.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Munive19","ee":"https://www.isa-afp.org/entries/Hybrid_Systems_VCs.html","url":"https://dblp.org/rec/journals/afp/Munive19"},
"url":"URL#1175836"
},
{
"@score":"1",
"@id":"1175837",
"info":{"authors":{"author":{"@pid":"173/3522","text":"Denis A. Nikiforov"}},"title":"Safe OCL.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Nikiforov19","ee":"https://www.isa-afp.org/entries/Safe_OCL.html","url":"https://dblp.org/rec/journals/afp/Nikiforov19"},
"url":"URL#1175837"
},
{
"@score":"1",
"@id":"1175838",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"An Efficient Generalization of Counting Sort for Large, possibly Infinite Key Ranges.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce19","ee":"https://www.isa-afp.org/entries/Generalized_Counting_Sort.html","url":"https://dblp.org/rec/journals/afp/Noce19"},
"url":"URL#1175838"
},
{
"@score":"1",
"@id":"1175839",
"info":{"authors":{"author":[{"@pid":"206/0176","text":"Julian Parsert"},{"@pid":"30/5217","text":"Cezary Kaliszyk"}]},"title":"Linear Programming.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/ParsertK19","ee":"https://www.isa-afp.org/entries/Linear_Programming.html","url":"https://dblp.org/rec/journals/afp/ParsertK19"},
"url":"URL#1175839"
},
{
"@score":"1",
"@id":"1175840",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"Fourier Series.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson19","ee":"https://www.isa-afp.org/entries/Fourier.html","url":"https://dblp.org/rec/journals/afp/Paulson19"},
"url":"URL#1175840"
},
{
"@score":"1",
"@id":"1175841",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"Zermelo Fraenkel Set Theory in Higher-Order Logic.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson19a","ee":"https://www.isa-afp.org/entries/ZFC_in_HOL.html","url":"https://dblp.org/rec/journals/afp/Paulson19a"},
"url":"URL#1175841"
},
{
"@score":"1",
"@id":"1175842",
"info":{"authors":{"author":{"@pid":"55/950","text":"André Platzer"}},"title":"Differential Game Logic.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Platzer19","ee":"https://www.isa-afp.org/entries/Differential_Game_Logic.html","url":"https://dblp.org/rec/journals/afp/Platzer19"},
"url":"URL#1175842"
},
{
"@score":"1",
"@id":"1175843",
"info":{"authors":{"author":{"@pid":"76/5899","text":"Martin Rau"}},"title":"Multidimensional Binary Search Trees.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Rau19","ee":"https://www.isa-afp.org/entries/KD_Tree.html","url":"https://dblp.org/rec/journals/afp/Rau19"},
"url":"URL#1175843"
},
{
"@score":"1",
"@id":"1175844",
"info":{"authors":{"author":[{"@pid":"257/8380","text":"Rodrigo Raya"},{"@pid":"139/6835","text":"Manuel Eberl"}]},"title":"Gauss Sums and the Pólya-Vinogradov Inequality.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/RayaE19","ee":"https://www.isa-afp.org/entries/Gauss_Sums.html","url":"https://dblp.org/rec/journals/afp/RayaE19"},
"url":"URL#1175844"
},
{
"@score":"1",
"@id":"1175845",
"info":{"authors":{"author":{"@pid":"248/1968","text":"Robert Sachtleben"}},"title":"Formalisation of an Adaptive State Counting Algorithm.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Sachtleben19","ee":"https://www.isa-afp.org/entries/Adaptive_State_Counting.html","url":"https://dblp.org/rec/journals/afp/Sachtleben19"},
"url":"URL#1175845"
},
{
"@score":"1",
"@id":"1175846",
"info":{"authors":{"author":[{"@pid":"173/4006","text":"Joshua Schneider 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Formalization of a Monitoring Algorithm for Metric First-Order Temporal Logic.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/SchneiderT19","ee":"https://www.isa-afp.org/entries/MFOTL_Monitor.html","url":"https://dblp.org/rec/journals/afp/SchneiderT19"},
"url":"URL#1175846"
},
{
"@score":"1",
"@id":"1175847",
"info":{"authors":{"author":[{"@pid":"243/8902","text":"Benedikt Seidl"},{"@pid":"129/1369","text":"Salomon Sickert"}]},"title":"A Compositional and Unified Translation of LTL into ω-Automata.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/SeidlS19","ee":"https://www.isa-afp.org/entries/LTL_Master_Theorem.html","url":"https://dblp.org/rec/journals/afp/SeidlS19"},
"url":"URL#1175847"
},
{
"@score":"1",
"@id":"1175848",
"info":{"authors":{"author":[{"@pid":"257/8698","text":"Danijela Simic"},{"@pid":"32/881","text":"Filip Maric"},{"@pid":"181/5041","text":"Pierre Boutry"}]},"title":"Poincaré Disc Model.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/SimicMB19","ee":"https://www.isa-afp.org/entries/Poincare_Disc.html","url":"https://dblp.org/rec/journals/afp/SimicMB19"},
"url":"URL#1175848"
},
{
"@score":"1",
"@id":"1175849",
"info":{"authors":{"author":[{"@pid":"236/6462","text":"Daniel Stüwe"},{"@pid":"139/6835","text":"Manuel Eberl"}]},"title":"Probabilistic Primality Testing.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/StuweE19","ee":"https://www.isa-afp.org/entries/Probabilistic_Prime_Tests.html","url":"https://dblp.org/rec/journals/afp/StuweE19"},
"url":"URL#1175849"
},
{
"@score":"1",
"@id":"1175850",
"info":{"authors":{"author":[{"@pid":"92/2595","text":"Safouan Taha"},{"@pid":"17/989","text":"Lina Ye"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"HOL-CSP Version 2.0.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/TahaYW19","ee":"https://www.isa-afp.org/entries/HOL-CSP.html","url":"https://dblp.org/rec/journals/afp/TahaYW19"},
"url":"URL#1175850"
},
{
"@score":"1",
"@id":"1175851",
"info":{"authors":{"author":[{"@pid":"81/10475","text":"Frédéric Tuong"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"Clean - An Abstract Imperative Programming Language and its Theory.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/TuongW19","ee":"https://www.isa-afp.org/entries/Clean.html","url":"https://dblp.org/rec/journals/afp/TuongW19"},
"url":"URL#1175851"
},
{
"@score":"1",
"@id":"1175852",
"info":{"authors":{"author":[{"@pid":"81/10475","text":"Frédéric Tuong"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"Isabelle/C.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/TuongW19a","ee":"https://www.isa-afp.org/entries/Isabelle_C.html","url":"https://dblp.org/rec/journals/afp/TuongW19a"},
"url":"URL#1175852"
},
{
"@score":"1",
"@id":"1175853",
"info":{"authors":{"author":[{"@pid":"171/1971","text":"Hai Nguyen Van"},{"@pid":"52/5245","text":"Frédéric Boulanger"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"A Formal Development of a Polychronous Polytimed Coordination Language.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/VanBW19","ee":"https://www.isa-afp.org/entries/TESL_Language.html","url":"https://dblp.org/rec/journals/afp/VanBW19"},
"url":"URL#1175853"
},
{
"@score":"1",
"@id":"1175854",
"info":{"authors":{"author":[{"@pid":"73/1149","text":"Jian Xu"},{"@pid":"66/3825","text":"Xingyuan Zhang"},{"@pid":"u/ChristianUrban","text":"Christian Urban"},{"@pid":"129/1473","text":"Sebastiaan J. C. Joosten"}]},"title":"Universal Turing Machine.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/XuZUJ19","ee":"https://www.isa-afp.org/entries/Universal_Turing_Machine.html","url":"https://dblp.org/rec/journals/afp/XuZUJ19"},
"url":"URL#1175854"
},
{
"@score":"1",
"@id":"1175855",
"info":{"authors":{"author":[{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"},{"@pid":"163/9743","text":"Jérémy Dubut"}]},"title":"Complete Non-Orders and Fixed Points.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/YamadaD19","ee":"https://www.isa-afp.org/entries/Complete_Non_Orders.html","url":"https://dblp.org/rec/journals/afp/YamadaD19"},
"url":"URL#1175855"
},
{
"@score":"1",
"@id":"1175856",
"info":{"authors":{"author":{"@pid":"145/5863-1","text":"Peter Zeller 0001"}},"title":"Szpilrajn Extension Theorem.","venue":"Arch. Formal Proofs","volume":"2019","year":"2019","type":"Data and Artifacts","access":"open","key":"journals/afp/Zeller19","ee":"https://www.isa-afp.org/entries/Szpilrajn.html","url":"https://dblp.org/rec/journals/afp/Zeller19"},
"url":"URL#1175856"
},
{
"@score":"1",
"@id":"1556328",
"info":{"authors":{"author":[{"@pid":"159/2755","text":"Mohammad Abdulaziz"},{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}]},"title":"An Isabelle/HOL formalisation of Green's Theorem.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/AbdulazizP18","ee":"https://www.isa-afp.org/entries/Green.html","url":"https://dblp.org/rec/journals/afp/AbdulazizP18"},
"url":"URL#1556328"
},
{
"@score":"1",
"@id":"1556329",
"info":{"authors":{"author":{"@pid":"220/2813","text":"Angeliki Koutsoukou-Argyraki"}},"title":"Octonions.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Argyraki18","ee":"https://www.isa-afp.org/entries/Octonions.html","url":"https://dblp.org/rec/journals/afp/Argyraki18"},
"url":"URL#1556329"
},
{
"@score":"1",
"@id":"1556330",
"info":{"authors":{"author":[{"@pid":"220/2813","text":"Angeliki Koutsoukou-Argyraki"},{"@pid":"132/9868","text":"Wenda Li"}]},"title":"Irrational Rapidly Convergent Series.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/ArgyrakiL18","ee":"https://www.isa-afp.org/entries/Irrationality_J_Hancl.html","url":"https://dblp.org/rec/journals/afp/ArgyrakiL18"},
"url":"URL#1556330"
},
{
"@score":"1",
"@id":"1556331",
"info":{"authors":{"author":{"@pid":"172/8673","text":"Alexander Bentkamp"}},"title":"Formalization of the Embedding Path Order for Lambda-Free Higher-Order Terms.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Bentkamp18","ee":"https://www.isa-afp.org/entries/Lambda_Free_EPO.html","url":"https://dblp.org/rec/journals/afp/Bentkamp18"},
"url":"URL#1556331"
},
{
"@score":"1",
"@id":"1556332",
"info":{"authors":{"author":[{"@pid":"b/CBenzmueller","text":"Christoph Benzmüller"},{"@pid":"s/DanaSScott","text":"Dana S. Scott"}]},"title":"Axiom Systems for Category Theory in Free Logic.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/BenzmullerS18","ee":"https://www.isa-afp.org/entries/AxiomaticCategoryTheory.html","url":"https://dblp.org/rec/journals/afp/BenzmullerS18"},
"url":"URL#1556332"
},
{
"@score":"1",
"@id":"1556333",
"info":{"authors":{"author":{"@pid":"207/8104","text":"Anthony Bordg"}},"title":"The Localization of a Commutative Ring.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Bordg18","ee":"https://www.isa-afp.org/entries/Localization_Ring.html","url":"https://dblp.org/rec/journals/afp/Bordg18"},
"url":"URL#1556333"
},
{
"@score":"1",
"@id":"1556334",
"info":{"authors":{"author":{"@pid":"207/8104","text":"Anthony Bordg"}},"title":"Projective Geometry.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Bordg18a","ee":"https://www.isa-afp.org/entries/Projective_Geometry.html","url":"https://dblp.org/rec/journals/afp/Bordg18a"},
"url":"URL#1556334"
},
{
"@score":"1",
"@id":"1556335",
"info":{"authors":{"author":[{"@pid":"169/6790","text":"Oliver Bracevac"},{"@pid":"116/4985","text":"Richard Gay"},{"@pid":"144/8769","text":"Sylvia Grewe"},{"@pid":"m/HeikoMantel","text":"Heiko Mantel"},{"@pid":"43/4026","text":"Henning Sudbrock"},{"@pid":"156/9549","text":"Markus Tasch"}]},"title":"An Isabelle/HOL Formalization of the Modular Assembly Kit for Security Properties.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/BracevacGGMST18","ee":"https://www.isa-afp.org/entries/Modular_Assembly_Kit_Security.html","url":"https://dblp.org/rec/journals/afp/BracevacGGMST18"},
"url":"URL#1556335"
},
{
"@score":"1",
"@id":"1556336",
"info":{"authors":{"author":[{"@pid":"b/FBrandt","text":"Felix Brandt 0001"},{"@pid":"139/6835","text":"Manuel Eberl"},{"@pid":"216/9641","text":"Christian Saile"},{"@pid":"10/765-1","text":"Christian Stricker 0001"}]},"title":"The Incompatibility of Fishburn-Strategyproofness and Pareto-Efficiency.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/BrandtESS18","ee":"https://www.isa-afp.org/entries/Fishburn_Impossibility.html","url":"https://dblp.org/rec/journals/afp/BrandtESS18"},
"url":"URL#1556336"
},
{
"@score":"1",
"@id":"1556337",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"150/9083","text":"Michael Herzberg"}]},"title":"A Formal Model of the Document Object Model.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerH18","ee":"https://www.isa-afp.org/entries/Core_DOM.html","url":"https://dblp.org/rec/journals/afp/BruckerH18"},
"url":"URL#1556337"
},
{
"@score":"1",
"@id":"1556338",
"info":{"authors":{"author":{"@pid":"180/8584","text":"Julian Brunner 0001"}},"title":"Partial Order Reduction.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Brunner18","ee":"https://www.isa-afp.org/entries/Partial_Order_Reduction.html","url":"https://dblp.org/rec/journals/afp/Brunner18"},
"url":"URL#1556338"
},
{
"@score":"1",
"@id":"1556339",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"129/1473","text":"Sebastiaan J. C. Joosten"},{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"A verified LLL algorithm.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonJTY18","ee":"https://www.isa-afp.org/entries/LLL_Basis_Reduction.html","url":"https://dblp.org/rec/journals/afp/DivasonJTY18"},
"url":"URL#1556339"
},
{
"@score":"1",
"@id":"1556340",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"129/1473","text":"Sebastiaan J. C. Joosten"},{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"A verified factorization algorithm for integer polynomials with polynomial complexity.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonJTY18a","ee":"https://www.isa-afp.org/entries/LLL_Factorization.html","url":"https://dblp.org/rec/journals/afp/DivasonJTY18a"},
"url":"URL#1556340"
},
{
"@score":"1",
"@id":"1556341",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Error Function.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl18","ee":"https://www.isa-afp.org/entries/Error_Function.html","url":"https://dblp.org/rec/journals/afp/Eberl18"},
"url":"URL#1556341"
},
{
"@score":"1",
"@id":"1556342",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Pell's Equation.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl18a","ee":"https://www.isa-afp.org/entries/Pell.html","url":"https://dblp.org/rec/journals/afp/Eberl18a"},
"url":"URL#1556342"
},
{
"@score":"1",
"@id":"1556343",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Symmetric Polynomials.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl18b","ee":"https://www.isa-afp.org/entries/Symmetric_Polynomials.html","url":"https://dblp.org/rec/journals/afp/Eberl18b"},
"url":"URL#1556343"
},
{
"@score":"1",
"@id":"1556344",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Transcendence of π.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl18c","ee":"https://www.isa-afp.org/entries/Pi_Transcendental.html","url":"https://dblp.org/rec/journals/afp/Eberl18c"},
"url":"URL#1556344"
},
{
"@score":"1",
"@id":"1556345",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Randomised Binary Search Trees.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl18d","ee":"https://www.isa-afp.org/entries/Randomised_BSTs.html","url":"https://dblp.org/rec/journals/afp/Eberl18d"},
"url":"URL#1556345"
},
{
"@score":"1",
"@id":"1556346",
"info":{"authors":{"author":[{"@pid":"139/6835","text":"Manuel Eberl"},{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}]},"title":"The Prime Number Theorem.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/EberlP18","ee":"https://www.isa-afp.org/entries/Prime_Number_Theorem.html","url":"https://dblp.org/rec/journals/afp/EberlP18"},
"url":"URL#1556346"
},
{
"@score":"1",
"@id":"1556347",
"info":{"authors":{"author":{"@pid":"24/2264","text":"Mnacho Echenim"}},"title":"Pricing in discrete financial models.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Echenim18","ee":"https://www.isa-afp.org/entries/DiscretePricing.html","url":"https://dblp.org/rec/journals/afp/Echenim18"},
"url":"URL#1556347"
},
{
"@score":"1",
"@id":"1556348",
"info":{"authors":{"author":{"@pid":"72/9638","text":"Bertram Felgenhauer"}},"title":"Minsky Machines.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Felgenhauer18","ee":"https://www.isa-afp.org/entries/Minsky_Machines.html","url":"https://dblp.org/rec/journals/afp/Felgenhauer18"},
"url":"URL#1556348"
},
{
"@score":"1",
"@id":"1556349",
"info":{"authors":{"author":{"@pid":"214/1791","text":"Asta Halkjær From"}},"title":"Epistemic Logic.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/From18","ee":"https://www.isa-afp.org/entries/Epistemic_Logic.html","url":"https://dblp.org/rec/journals/afp/From18"},
"url":"URL#1556349"
},
{
"@score":"1",
"@id":"1556350",
"info":{"authors":{"author":[{"@pid":"199/6154","text":"David Fuenmayor"},{"@pid":"b/CBenzmueller","text":"Christoph Benzmüller"}]},"title":"Formalisation and Evaluation of Alan Gewirth's Proof for the Principle of Generic Consistency in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/FuenmayorB18","ee":"https://www.isa-afp.org/entries/GewirthPGCProof.html","url":"https://dblp.org/rec/journals/afp/FuenmayorB18"},
"url":"URL#1556350"
},
{
"@score":"1",
"@id":"1556351",
"info":{"authors":{"author":{"@pid":"168/5699","text":"Sebastien Gouezel"}},"title":"Gromov Hyperbolicity.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Gouezel18","ee":"https://www.isa-afp.org/entries/Gromov_Hyperbolicity.html","url":"https://dblp.org/rec/journals/afp/Gouezel18"},
"url":"URL#1556351"
},
{
"@score":"1",
"@id":"1556352",
"info":{"authors":{"author":{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"}},"title":"Aggregation Algebras.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Guttmann18","ee":"https://www.isa-afp.org/entries/Aggregation_Algebras.html","url":"https://dblp.org/rec/journals/afp/Guttmann18"},
"url":"URL#1556352"
},
{
"@score":"1",
"@id":"1556353",
"info":{"authors":{"author":[{"@pid":"222/4355","text":"Max W. Haslbeck"},{"@pid":"139/6835","text":"Manuel Eberl"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Treaps.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/HaslbeckEN18","ee":"https://www.isa-afp.org/entries/Treaps.html","url":"https://dblp.org/rec/journals/afp/HaslbeckEN18"},
"url":"URL#1556353"
},
{
"@score":"1",
"@id":"1556354",
"info":{"authors":{"author":[{"@pid":"134/6302","text":"Maximilian P. L. Haslbeck"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Hoare Logics for Time Bounds.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/HaslbeckN18","ee":"https://www.isa-afp.org/entries/Hoare_Time.html","url":"https://dblp.org/rec/journals/afp/HaslbeckN18"},
"url":"URL#1556354"
},
{
"@score":"1",
"@id":"1556355",
"info":{"authors":{"author":{"@pid":"143/3168","text":"Lars Hupel"}},"title":"CakeML.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Hupel18","ee":"https://www.isa-afp.org/entries/CakeML.html","url":"https://dblp.org/rec/journals/afp/Hupel18"},
"url":"URL#1556355"
},
{
"@score":"1",
"@id":"1556356",
"info":{"authors":{"author":[{"@pid":"47/11065","text":"Fabian Immler"},{"@pid":"31/11002","text":"Bohua Zhan"}]},"title":"Smooth Manifolds.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/ImmlerZ18","ee":"https://www.isa-afp.org/entries/Smooth_Manifolds.html","url":"https://dblp.org/rec/journals/afp/ImmlerZ18"},
"url":"URL#1556356"
},
{
"@score":"1",
"@id":"1556357",
"info":{"authors":{"author":{"@pid":"129/1473","text":"Sebastiaan J. C. Joosten"}},"title":"Graph Saturation.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Joosten18","ee":"https://www.isa-afp.org/entries/Graph_Saturation.html","url":"https://dblp.org/rec/journals/afp/Joosten18"},
"url":"URL#1556357"
},
{
"@score":"1",
"@id":"1556358",
"info":{"authors":{"author":{"@pid":"205/6105","text":"Jonas Keinholz"}},"title":"Matroids.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Keinholz18","ee":"https://www.isa-afp.org/entries/Matroids.html","url":"https://dblp.org/rec/journals/afp/Keinholz18"},
"url":"URL#1556358"
},
{
"@score":"1",
"@id":"1556359",
"info":{"authors":{"author":[{"@pid":"148/2880","text":"Martin Kleppmann"},{"@pid":"139/0605","text":"Victor B. F. Gomes"},{"@pid":"96/3526","text":"Dominic P. Mulligan"},{"@pid":"29/361","text":"Alastair R. Beresford"}]},"title":"OpSets - Sequential Specifications for Replicated Datatypes.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/KleppmannGMB18","ee":"https://www.isa-afp.org/entries/OpSets.html","url":"https://dblp.org/rec/journals/afp/KleppmannGMB18"},
"url":"URL#1556359"
},
{
"@score":"1",
"@id":"1556360",
"info":{"authors":{"author":[{"@pid":"228/5055","text":"Friedrich Kurz"},{"@pid":"159/2755","text":"Mohammad Abdulaziz"}]},"title":"Upper Bounding Diameters of State Spaces of Factored Transition Systems.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/KurzA18","ee":"https://www.isa-afp.org/entries/Factored_Transition_System_Bounding.html","url":"https://dblp.org/rec/journals/afp/KurzA18"},
"url":"URL#1556360"
},
{
"@score":"1",
"@id":"1556361",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"132/9797","text":"Simon Wimmer 0001"}]},"title":"VerifyThis 2018 - Polished Isabelle Solutions.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichW18","ee":"https://www.isa-afp.org/entries/VerifyThis2018.html","url":"https://dblp.org/rec/journals/afp/LammichW18"},
"url":"URL#1556361"
},
{
"@score":"1",
"@id":"1556362",
"info":{"authors":{"author":{"@pid":"132/9868","text":"Wenda Li"}},"title":"The Budan-Fourier Theorem and Counting Real Roots with Multiplicity.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Li18","ee":"https://www.isa-afp.org/entries/Budan_Fourier.html","url":"https://dblp.org/rec/journals/afp/Li18"},
"url":"URL#1556362"
},
{
"@score":"1",
"@id":"1556363",
"info":{"authors":{"author":[{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"173/4006","text":"Joshua Schneider 0001"}]},"title":"Bounded Natural Functors with Covariance and Contravariance.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/LochbihlerS18","ee":"https://www.isa-afp.org/entries/BNF_CC.html","url":"https://dblp.org/rec/journals/afp/LochbihlerS18"},
"url":"URL#1556363"
},
{
"@score":"1",
"@id":"1556364",
"info":{"authors":{"author":[{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"183/9400","text":"S. Reza Sefidgar"}]},"title":"Constructive Cryptography in HOL.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/LochbihlerS18a","ee":"https://www.isa-afp.org/entries/Constructive_Cryptography.html","url":"https://dblp.org/rec/journals/afp/LochbihlerS18a"},
"url":"URL#1556364"
},
{
"@score":"1",
"@id":"1556365",
"info":{"authors":{"author":{"@pid":"149/2436","text":"Alexander Maletzky"}},"title":"Signature-Based Gröbner Basis Algorithms.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Maletzky18","ee":"https://www.isa-afp.org/entries/Signature_Groebner.html","url":"https://dblp.org/rec/journals/afp/Maletzky18"},
"url":"URL#1556365"
},
{
"@score":"1",
"@id":"1556366",
"info":{"authors":{"author":[{"@pid":"32/881","text":"Filip Maric"},{"@pid":"118/0085","text":"Mirko Spasic"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"An Incremental Simplex Algorithm with Unsatisfiable Core Generation.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/MaricST18","ee":"https://www.isa-afp.org/entries/Simplex.html","url":"https://dblp.org/rec/journals/afp/MaricST18"},
"url":"URL#1556366"
},
{
"@score":"1",
"@id":"1556367",
"info":{"authors":{"author":{"@pid":"153/5319","text":"Diego Marmsoler"}},"title":"A Theory of Architectural Design Patterns.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Marmsoler18","ee":"https://www.isa-afp.org/entries/Architectural_Design_Patterns.html","url":"https://dblp.org/rec/journals/afp/Marmsoler18"},
"url":"URL#1556367"
},
{
"@score":"1",
"@id":"1556368",
"info":{"authors":{"author":[{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"},{"@pid":"216/9454","text":"Stefan Dirix"}]},"title":"Weight-Balanced Trees.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/NipkowD18","ee":"https://www.isa-afp.org/entries/Weight_Balanced_Trees.html","url":"https://dblp.org/rec/journals/afp/NipkowD18"},
"url":"URL#1556368"
},
{
"@score":"1",
"@id":"1556369",
"info":{"authors":{"author":[{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"},{"@pid":"220/2939","text":"Dániel Somogyi"}]},"title":"Optimal Binary Search Trees.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/NipkowS18","ee":"https://www.isa-afp.org/entries/Optimal_BST.html","url":"https://dblp.org/rec/journals/afp/NipkowS18"},
"url":"URL#1556369"
},
{
"@score":"1",
"@id":"1556370",
"info":{"authors":{"author":{"@pid":"222/3424","text":"Roy Overbeek"}},"title":"Formalization of Concurrent Revisions.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Overbeek18","ee":"https://www.isa-afp.org/entries/Concurrent_Revisions.html","url":"https://dblp.org/rec/journals/afp/Overbeek18"},
"url":"URL#1556370"
},
{
"@score":"1",
"@id":"1556371",
"info":{"authors":{"author":[{"@pid":"206/0176","text":"Julian Parsert"},{"@pid":"30/5217","text":"Cezary Kaliszyk"}]},"title":"Von-Neumann-Morgenstern Utility Theorem.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/ParsertK18","ee":"https://www.isa-afp.org/entries/Neumann_Morgenstern_Utility.html","url":"https://dblp.org/rec/journals/afp/ParsertK18"},
"url":"URL#1556371"
},
{
"@score":"1",
"@id":"1556372",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"Quaternions.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson18","ee":"https://www.isa-afp.org/entries/Quaternions.html","url":"https://dblp.org/rec/journals/afp/Paulson18"},
"url":"URL#1556372"
},
{
"@score":"1",
"@id":"1556373",
"info":{"authors":{"author":[{"@pid":"205/2283","text":"Jonas Rädle"},{"@pid":"143/3168","text":"Lars Hupel"}]},"title":"Deriving generic class instances for datatypes.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/RadleH18","ee":"https://www.isa-afp.org/entries/Generic_Deriving.html","url":"https://dblp.org/rec/journals/afp/RadleH18"},
"url":"URL#1556373"
},
{
"@score":"1",
"@id":"1556374",
"info":{"authors":{"author":[{"@pid":"166/1371","text":"Anders Schlichtkrull"},{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"95/10567","text":"Dmitriy Traytel"},{"@pid":"w/UweWaldmann","text":"Uwe Waldmann"}]},"title":"Formalization of Bachmair and Ganzinger's Ordered Resolution Prover.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/SchlichtkrullBT18","ee":"https://www.isa-afp.org/entries/Ordered_Resolution_Prover.html","url":"https://dblp.org/rec/journals/afp/SchlichtkrullBT18"},
"url":"URL#1556374"
},
{
"@score":"1",
"@id":"1556375",
"info":{"authors":{"author":[{"@pid":"166/1371","text":"Anders Schlichtkrull"},{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"A Verified Functional Implementation of Bachmair and Ganzinger's Ordered Resolution Prover.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/SchlichtkrullBT18a","ee":"https://www.isa-afp.org/entries/Functional_Ordered_Resolution_Prover.html","url":"https://dblp.org/rec/journals/afp/SchlichtkrullBT18a"},
"url":"URL#1556375"
},
{
"@score":"1",
"@id":"1556376",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"First-Order Terms.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT18","ee":"https://www.isa-afp.org/entries/First_Order_Terms.html","url":"https://dblp.org/rec/journals/afp/SternagelT18"},
"url":"URL#1556376"
},
{
"@score":"1",
"@id":"1556377",
"info":{"authors":{"author":{"@pid":"57/4783","text":"Georg Struth"}},"title":"Properties of Orderings and Lattices.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Struth18","ee":"https://www.isa-afp.org/entries/Order_Lattice_Props.html","url":"https://dblp.org/rec/journals/afp/Struth18"},
"url":"URL#1556377"
},
{
"@score":"1",
"@id":"1556378",
"info":{"authors":{"author":{"@pid":"57/4783","text":"Georg Struth"}},"title":"Quantales.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Struth18a","ee":"https://www.isa-afp.org/entries/Quantales.html","url":"https://dblp.org/rec/journals/afp/Struth18a"},
"url":"URL#1556378"
},
{
"@score":"1",
"@id":"1556379",
"info":{"authors":{"author":{"@pid":"57/4783","text":"Georg Struth"}},"title":"Transformer Semantics.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Struth18b","ee":"https://www.isa-afp.org/entries/Transformer_Semantics.html","url":"https://dblp.org/rec/journals/afp/Struth18b"},
"url":"URL#1556379"
},
{
"@score":"1",
"@id":"1556380",
"info":{"authors":{"author":[{"@pid":"183/9312","text":"Christoph Traut"},{"@pid":"47/11065","text":"Fabian Immler"}]},"title":"Taylor Models.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/TrautI18","ee":"https://www.isa-afp.org/entries/Taylor_Models.html","url":"https://dblp.org/rec/journals/afp/TrautI18"},
"url":"URL#1556380"
},
{
"@score":"1",
"@id":"1556381",
"info":{"authors":{"author":{"@pid":"165/2801","text":"Conrad Watt"}},"title":"WebAssembly.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Watt18","ee":"https://www.isa-afp.org/entries/WebAssembly.html","url":"https://dblp.org/rec/journals/afp/Watt18"},
"url":"URL#1556381"
},
{
"@score":"1",
"@id":"1556382",
"info":{"authors":{"author":{"@pid":"132/9797","text":"Simon Wimmer 0001"}},"title":"Hidden Markov Models.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Wimmer18","ee":"https://www.isa-afp.org/entries/Hidden_Markov_Models.html","url":"https://dblp.org/rec/journals/afp/Wimmer18"},
"url":"URL#1556382"
},
{
"@score":"1",
"@id":"1556383",
"info":{"authors":{"author":[{"@pid":"132/9797","text":"Simon Wimmer 0001"},{"@pid":"21/8611","text":"Johannes Hölzl"}]},"title":"Probabilistic Timed Automata.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/WimmerH18","ee":"https://www.isa-afp.org/entries/Probabilistic_Timed_Automata.html","url":"https://dblp.org/rec/journals/afp/WimmerH18"},
"url":"URL#1556383"
},
{
"@score":"1",
"@id":"1556384",
"info":{"authors":{"author":[{"@pid":"132/9797","text":"Simon Wimmer 0001"},{"@pid":"220/2932","text":"Shuwei Hu"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Monadification, Memoization and Dynamic Programming.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/WimmerHN18","ee":"https://www.isa-afp.org/entries/Monad_Memo_DP.html","url":"https://dblp.org/rec/journals/afp/WimmerHN18"},
"url":"URL#1556384"
},
{
"@score":"1",
"@id":"1556385",
"info":{"authors":{"author":{"@pid":"31/11002","text":"Bohua Zhan"}},"title":"Auto2 Prover.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Zhan18","ee":"https://www.isa-afp.org/entries/Auto2_HOL.html","url":"https://dblp.org/rec/journals/afp/Zhan18"},
"url":"URL#1556385"
},
{
"@score":"1",
"@id":"1556386",
"info":{"authors":{"author":{"@pid":"31/11002","text":"Bohua Zhan"}},"title":"Verifying Imperative Programs using Auto2.","venue":"Arch. Formal Proofs","volume":"2018","year":"2018","type":"Data and Artifacts","access":"open","key":"journals/afp/Zhan18a","ee":"https://www.isa-afp.org/entries/Auto2_Imperative_HOL.html","url":"https://dblp.org/rec/journals/afp/Zhan18a"},
"url":"URL#1556386"
},
{
"@score":"1",
"@id":"1900675",
"info":{"authors":{"author":{"@pid":"81/3747","text":"Stefan Berghofer"}},"title":"The Group Law for Elliptic Curves.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Berghofer17","ee":"https://www.isa-afp.org/entries/Elliptic_Curves_Group_Law.shtml","url":"https://dblp.org/rec/journals/afp/Berghofer17"},
"url":"URL#1900675"
},
{
"@score":"1",
"@id":"1900676",
"info":{"authors":{"author":[{"@pid":"194/1106","text":"Julian Biendarra"},{"@pid":"139/6835","text":"Manuel Eberl"}]},"title":"Bertrand's postulate.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/BiendarraE17","ee":"https://www.isa-afp.org/entries/Bertrands_Postulate.shtml","url":"https://dblp.org/rec/journals/afp/BiendarraE17"},
"url":"URL#1900676"
},
{
"@score":"1",
"@id":"1900677",
"info":{"authors":{"author":[{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Abstract Soundness.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/BlanchettePT17","ee":"https://www.isa-afp.org/entries/Abstract_Soundness.shtml","url":"https://dblp.org/rec/journals/afp/BlanchettePT17"},
"url":"URL#1900677"
},
{
"@score":"1",
"@id":"1900678",
"info":{"authors":{"author":[{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Operations on Bounded Natural Functors.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/BlanchettePT17a","ee":"https://www.isa-afp.org/entries/BNF_Operations.html","url":"https://dblp.org/rec/journals/afp/BlanchettePT17a"},
"url":"URL#1900678"
},
{
"@score":"1",
"@id":"1900679",
"info":{"authors":{"author":{"@pid":"206/0137","text":"Ben Blumson"}},"title":"Anselm's God in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Blumson17","ee":"https://www.isa-afp.org/entries/AnselmGod.html","url":"https://dblp.org/rec/journals/afp/Blumson17"},
"url":"URL#1900679"
},
{
"@score":"1",
"@id":"1900680",
"info":{"authors":{"author":{"@pid":"192/2258","text":"Brandon Bohrer"}},"title":"Differential Dynamic Logic.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Bohrer17","ee":"https://www.isa-afp.org/entries/Differential_Dynamic_Logic.shtml","url":"https://dblp.org/rec/journals/afp/Bohrer17"},
"url":"URL#1900680"
},
{
"@score":"1",
"@id":"1900681",
"info":{"authors":{"author":[{"@pid":"80/9827","text":"Joachim Breitner"},{"@pid":"69/3465","text":"Brian Huffman"},{"@pid":"69/3345","text":"Neil Mitchell"},{"@pid":"33/287","text":"Christian Sternagel"}]},"title":"HOLCF-Prelude.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/BreitnerHMS17","ee":"https://www.isa-afp.org/entries/HOLCF-Prelude.shtml","url":"https://dblp.org/rec/journals/afp/BreitnerHMS17"},
"url":"URL#1900681"
},
{
"@score":"1",
"@id":"1900682",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"77/372","text":"Lukas Brügger"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"Formal Network Models and Their Application to Firewall Policies.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerBW17","ee":"https://www.isa-afp.org/entries/UPF_Firewall.shtml","url":"https://dblp.org/rec/journals/afp/BruckerBW17"},
"url":"URL#1900682"
},
{
"@score":"1",
"@id":"1900683",
"info":{"authors":{"author":{"@pid":"180/8584","text":"Julian Brunner 0001"}},"title":"Büchi Complementation.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Brunner17","ee":"https://www.isa-afp.org/entries/Buchi_Complementation.html","url":"https://dblp.org/rec/journals/afp/Brunner17"},
"url":"URL#1900683"
},
{
"@score":"1",
"@id":"1900684",
"info":{"authors":{"author":{"@pid":"180/8584","text":"Julian Brunner 0001"}},"title":"Transition Systems and Automata.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Brunner17a","ee":"https://www.isa-afp.org/entries/Transition_Systems_and_Automata.html","url":"https://dblp.org/rec/journals/afp/Brunner17a"},
"url":"URL#1900684"
},
{
"@score":"1",
"@id":"1900685",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Stewart's Theorem and Apollonius' Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn17","ee":"https://www.isa-afp.org/entries/Stewart_Apollonius.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn17"},
"url":"URL#1900685"
},
{
"@score":"1",
"@id":"1900686",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"The Falling Factorial of a Sum.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn17a","ee":"https://www.isa-afp.org/entries/Falling_Factorial_Sum.html","url":"https://dblp.org/rec/journals/afp/Bulwahn17a"},
"url":"URL#1900686"
},
{
"@score":"1",
"@id":"1900687",
"info":{"authors":{"author":[{"@pid":"36/4781","text":"Lukas Bulwahn"},{"@pid":"139/6835","text":"Manuel Eberl"}]},"title":"Bernoulli Numbers.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/BulwahnE17","ee":"https://www.isa-afp.org/entries/Bernoulli.shtml","url":"https://dblp.org/rec/journals/afp/BulwahnE17"},
"url":"URL#1900687"
},
{
"@score":"1",
"@id":"1900688",
"info":{"authors":{"author":{"@pid":"117/9280","text":"Christoph Dittmann"}},"title":"Menger's Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Dittmann17","ee":"https://www.isa-afp.org/entries/Menger.shtml","url":"https://dblp.org/rec/journals/afp/Dittmann17"},
"url":"URL#1900688"
},
{
"@score":"1",
"@id":"1900689",
"info":{"authors":{"author":[{"@pid":"01/4516","text":"Brijesh Dongol"},{"@pid":"139/0605","text":"Victor B. F. Gomes"},{"@pid":"h/IanJHayes","text":"Ian J. Hayes"},{"@pid":"57/4783","text":"Georg Struth"}]},"title":"Partial Semigroups and Convolution Algebras.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/DongolGHS17","ee":"https://www.isa-afp.org/entries/PSemigroupsConvolution.shtml","url":"https://dblp.org/rec/journals/afp/DongolGHS17"},
"url":"URL#1900689"
},
{
"@score":"1",
"@id":"1900690",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Transcendence of e.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17","ee":"https://www.isa-afp.org/entries/E_Transcendental.shtml","url":"https://dblp.org/rec/journals/afp/Eberl17"},
"url":"URL#1900690"
},
{
"@score":"1",
"@id":"1900691",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Euler-MacLaurin Formula.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17a","ee":"https://www.isa-afp.org/entries/Euler_MacLaurin.shtml","url":"https://dblp.org/rec/journals/afp/Eberl17a"},
"url":"URL#1900691"
},
{
"@score":"1",
"@id":"1900692",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Lower bound on comparison-based sorting algorithms.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17b","ee":"https://www.isa-afp.org/entries/Comparison_Sort_Lower_Bound.shtml","url":"https://dblp.org/rec/journals/afp/Eberl17b"},
"url":"URL#1900692"
},
{
"@score":"1",
"@id":"1900693",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The number of comparisons in QuickSort.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17c","ee":"https://www.isa-afp.org/entries/Quick_Sort_Cost.shtml","url":"https://dblp.org/rec/journals/afp/Eberl17c"},
"url":"URL#1900693"
},
{
"@score":"1",
"@id":"1900694",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Expected Shape of Random Binary Search Trees.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17d","ee":"https://www.isa-afp.org/entries/Random_BSTs.shtml","url":"https://dblp.org/rec/journals/afp/Eberl17d"},
"url":"URL#1900694"
},
{
"@score":"1",
"@id":"1900695",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Buffon's Needle Problem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17e","ee":"https://www.isa-afp.org/entries/Buffons_Needle.shtml","url":"https://dblp.org/rec/journals/afp/Eberl17e"},
"url":"URL#1900695"
},
{
"@score":"1",
"@id":"1900696",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Minkowski's Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17f","ee":"https://www.isa-afp.org/entries/Minkowskis_Theorem.shtml","url":"https://dblp.org/rec/journals/afp/Eberl17f"},
"url":"URL#1900696"
},
{
"@score":"1",
"@id":"1900697",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Dirichlet Series.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17g","ee":"https://www.isa-afp.org/entries/Dirichlet_Series.html","url":"https://dblp.org/rec/journals/afp/Eberl17g"},
"url":"URL#1900697"
},
{
"@score":"1",
"@id":"1900698",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Hurwitz and Riemann ζ Functions.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17h","ee":"https://www.isa-afp.org/entries/Zeta_Function.html","url":"https://dblp.org/rec/journals/afp/Eberl17h"},
"url":"URL#1900698"
},
{
"@score":"1",
"@id":"1900699",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Linear Recurrences.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17i","ee":"https://www.isa-afp.org/entries/Linear_Recurrences.html","url":"https://dblp.org/rec/journals/afp/Eberl17i"},
"url":"URL#1900699"
},
{
"@score":"1",
"@id":"1900700",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Mason-Stother's Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17j","ee":"https://www.isa-afp.org/entries/Mason_Stothers.html","url":"https://dblp.org/rec/journals/afp/Eberl17j"},
"url":"URL#1900700"
},
{
"@score":"1",
"@id":"1900701",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Median-of-Medians Selection Algorithm.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17k","ee":"https://www.isa-afp.org/entries/Median_Of_Medians_Selection.html","url":"https://dblp.org/rec/journals/afp/Eberl17k"},
"url":"URL#1900701"
},
{
"@score":"1",
"@id":"1900702",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Dirichlet L-Functions and Dirichlet's Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl17l","ee":"https://www.isa-afp.org/entries/Dirichlet_L.html","url":"https://dblp.org/rec/journals/afp/Eberl17l"},
"url":"URL#1900702"
},
{
"@score":"1",
"@id":"1900703",
"info":{"authors":{"author":[{"@pid":"14/4971","text":"Simon Foster 0001"},{"@pid":"23/6727","text":"Frank Zeyda"}]},"title":"Optics.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/FosterZ17","ee":"https://www.isa-afp.org/entries/Optics.shtml","url":"https://dblp.org/rec/journals/afp/FosterZ17"},
"url":"URL#1900703"
},
{
"@score":"1",
"@id":"1900704",
"info":{"authors":{"author":[{"@pid":"199/6154","text":"David Fuenmayor"},{"@pid":"b/CBenzmueller","text":"Christoph Benzmüller"}]},"title":"Types, Tableaus and Gödel's God in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/FuenmayorB17","ee":"https://www.isa-afp.org/entries/Types_Tableaus_and_Goedels_God.shtml","url":"https://dblp.org/rec/journals/afp/FuenmayorB17"},
"url":"URL#1900704"
},
{
"@score":"1",
"@id":"1900705",
"info":{"authors":{"author":[{"@pid":"199/6154","text":"David Fuenmayor"},{"@pid":"b/CBenzmueller","text":"Christoph Benzmüller"}]},"title":"Computer-assisted Reconstruction and Assessment of E. J. Lowe's Modal Ontological Argument.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/FuenmayorB17a","ee":"https://www.isa-afp.org/entries/Lowe_Ontological_Argument.html","url":"https://dblp.org/rec/journals/afp/FuenmayorB17a"},
"url":"URL#1900705"
},
{
"@score":"1",
"@id":"1900706",
"info":{"authors":{"author":[{"@pid":"20/6956","text":"Peter Gammie"},{"@pid":"03/5795","text":"Gianpaolo Gioiosa"}]},"title":"The Kuratowski Closure-Complement Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/GammieG17","ee":"https://www.isa-afp.org/entries/Kuratowski_Closure_Complement.html","url":"https://dblp.org/rec/journals/afp/GammieG17"},
"url":"URL#1900706"
},
{
"@score":"1",
"@id":"1900707",
"info":{"authors":{"author":[{"@pid":"139/0605","text":"Victor B. F. Gomes"},{"@pid":"148/2880","text":"Martin Kleppmann"},{"@pid":"96/3526","text":"Dominic P. Mulligan"},{"@pid":"29/361","text":"Alastair R. Beresford"}]},"title":"A framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/GomesKMB17","ee":"https://www.isa-afp.org/entries/CRDT.shtml","url":"https://dblp.org/rec/journals/afp/GomesKMB17"},
"url":"URL#1900707"
},
{
"@score":"1",
"@id":"1900708",
"info":{"authors":{"author":{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"}},"title":"Stone Relation Algebras.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Guttmann17","ee":"https://www.isa-afp.org/entries/Stone_Relation_Algebras.shtml","url":"https://dblp.org/rec/journals/afp/Guttmann17"},
"url":"URL#1900708"
},
{
"@score":"1",
"@id":"1900709",
"info":{"authors":{"author":{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"}},"title":"Stone-Kleene Relation Algebras.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Guttmann17a","ee":"https://www.isa-afp.org/entries/Stone_Kleene_Relation_Algebras.html","url":"https://dblp.org/rec/journals/afp/Guttmann17a"},
"url":"URL#1900709"
},
{
"@score":"1",
"@id":"1900710",
"info":{"authors":{"author":[{"@pid":"212/1559","text":"Fabian Hellauer"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"The string search algorithm by Knuth, Morris and Pratt.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/HellauerL17","ee":"https://www.isa-afp.org/entries/Knuth_Morris_Pratt.html","url":"https://dblp.org/rec/journals/afp/HellauerL17"},
"url":"URL#1900710"
},
{
"@score":"1",
"@id":"1900711",
"info":{"authors":{"author":{"@pid":"143/3168","text":"Lars Hupel"}},"title":"Lazifying case constants.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Hupel17","ee":"https://www.isa-afp.org/entries/Lazy_Case.shtml","url":"https://dblp.org/rec/journals/afp/Hupel17"},
"url":"URL#1900711"
},
{
"@score":"1",
"@id":"1900712",
"info":{"authors":{"author":{"@pid":"143/3168","text":"Lars Hupel"}},"title":"Constructor Functions.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Hupel17a","ee":"https://www.isa-afp.org/entries/Constructor_Funs.shtml","url":"https://dblp.org/rec/journals/afp/Hupel17a"},
"url":"URL#1900712"
},
{
"@score":"1",
"@id":"1900713",
"info":{"authors":{"author":{"@pid":"143/3168","text":"Lars Hupel"}},"title":"Dictionary Construction.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Hupel17b","ee":"https://www.isa-afp.org/entries/Dict_Construction.html","url":"https://dblp.org/rec/journals/afp/Hupel17b"},
"url":"URL#1900713"
},
{
"@score":"1",
"@id":"1900714",
"info":{"authors":{"author":[{"@pid":"166/1639","text":"Alexander Birch Jensen"},{"@pid":"166/1371","text":"Anders Schlichtkrull"},{"@pid":"v/JorgenVilladsen","text":"Jørgen Villadsen"}]},"title":"First-Order Logic According to Harrison.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/JensenSV17","ee":"https://www.isa-afp.org/entries/FOL_Harrison.shtml","url":"https://dblp.org/rec/journals/afp/JensenSV17"},
"url":"URL#1900714"
},
{
"@score":"1",
"@id":"1900715",
"info":{"authors":{"author":[{"@pid":"129/1473","text":"Sebastiaan J. C. Joosten"},{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"Subresultants.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/JoostenTY17","ee":"https://www.isa-afp.org/entries/Subresultants.shtml","url":"https://dblp.org/rec/journals/afp/JoostenTY17"},
"url":"URL#1900715"
},
{
"@score":"1",
"@id":"1900716",
"info":{"authors":{"author":[{"@pid":"173/5042","text":"Tim Jungnickel"},{"@pid":"209/7122","text":"Lennart Oldenburg"},{"@pid":"209/7673","text":"Matthias Loibl"}]},"title":"The IMAP CmRDT.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/JungnickelOL17","ee":"https://www.isa-afp.org/entries/IMAP-CRDT.html","url":"https://dblp.org/rec/journals/afp/JungnickelOL17"},
"url":"URL#1900716"
},
{
"@score":"1",
"@id":"1900717",
"info":{"authors":{"author":{"@pid":"46/4542","text":"Daniel Kirchner"}},"title":"Representation and Partial Automation of the Principia Logico-Metaphysica in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Kirchner17","ee":"https://www.isa-afp.org/entries/PLM.html","url":"https://dblp.org/rec/journals/afp/Kirchner17"},
"url":"URL#1900717"
},
{
"@score":"1",
"@id":"1900718",
"info":{"authors":{"author":[{"@pid":"179/4217","text":"Joseph Lallemand"},{"@pid":"s/ChristophSprenger","text":"Christoph Sprenger 0001"}]},"title":"Refining Authenticated Key Agreement with Strong Adversaries.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/LallemandS17","ee":"https://www.isa-afp.org/entries/Key_Agreement_Strong_Adversaries.shtml","url":"https://dblp.org/rec/journals/afp/LallemandS17"},
"url":"URL#1900718"
},
{
"@score":"1",
"@id":"1900719",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"183/9400","text":"S. Reza Sefidgar"}]},"title":"Flow Networks and the Min-Cut-Max-Flow Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichS17","ee":"https://www.isa-afp.org/entries/Flow_Networks.shtml","url":"https://dblp.org/rec/journals/afp/LammichS17"},
"url":"URL#1900719"
},
{
"@score":"1",
"@id":"1900720",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"183/9400","text":"S. Reza Sefidgar"}]},"title":"Formalizing Push-Relabel Algorithms.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichS17a","ee":"https://www.isa-afp.org/entries/Prpu_Maxflow.shtml","url":"https://dblp.org/rec/journals/afp/LammichS17a"},
"url":"URL#1900720"
},
{
"@score":"1",
"@id":"1900721",
"info":{"authors":{"author":{"@pid":"132/9868","text":"Wenda Li"}},"title":"Count the Number of Complex Roots.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Li17","ee":"https://www.isa-afp.org/entries/Count_Complex_Roots.html","url":"https://dblp.org/rec/journals/afp/Li17"},
"url":"URL#1900721"
},
{
"@score":"1",
"@id":"1900722",
"info":{"authors":{"author":{"@pid":"132/9868","text":"Wenda Li"}},"title":"Evaluate winding numbers through Cauchy indices.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Li17a","ee":"https://www.isa-afp.org/entries/Winding_Number_Eval.html","url":"https://dblp.org/rec/journals/afp/Li17a"},
"url":"URL#1900722"
},
{
"@score":"1",
"@id":"1900723",
"info":{"authors":{"author":{"@pid":"48/8323","text":"Sven Linker"}},"title":"Hybrid Multi-Lane Spatial Logic.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Linker17","ee":"https://www.isa-afp.org/entries/Hybrid_Multi_Lane_Spatial_Logic.html","url":"https://dblp.org/rec/journals/afp/Linker17"},
"url":"URL#1900723"
},
{
"@score":"1",
"@id":"1900724",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"CryptHOL.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler17","ee":"https://www.isa-afp.org/entries/CryptHOL.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler17"},
"url":"URL#1900724"
},
{
"@score":"1",
"@id":"1900725",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"Effect polymorphism in higher-order logic.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler17a","ee":"https://www.isa-afp.org/entries/Monomorphic_Monad.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler17a"},
"url":"URL#1900725"
},
{
"@score":"1",
"@id":"1900726",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"Probabilistic while loop.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler17b","ee":"https://www.isa-afp.org/entries/Probabilistic_While.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler17b"},
"url":"URL#1900726"
},
{
"@score":"1",
"@id":"1900727",
"info":{"authors":{"author":[{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"183/9400","text":"S. Reza Sefidgar"},{"@pid":"200/6079","text":"Bhargav Bhatt"}]},"title":"Game-based cryptography in HOL.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/LochbihlerSB17","ee":"https://www.isa-afp.org/entries/Game_Based_Crypto.shtml","url":"https://dblp.org/rec/journals/afp/LochbihlerSB17"},
"url":"URL#1900727"
},
{
"@score":"1",
"@id":"1900728",
"info":{"authors":{"author":{"@pid":"153/5319","text":"Diego Marmsoler"}},"title":"Dynamic Architectures.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Marmsoler17","ee":"https://www.isa-afp.org/entries/DynamicArchitectures.shtml","url":"https://dblp.org/rec/journals/afp/Marmsoler17"},
"url":"URL#1900728"
},
{
"@score":"1",
"@id":"1900729",
"info":{"authors":{"author":[{"@pid":"205/1554","text":"Cristina Matache"},{"@pid":"139/0605","text":"Victor B. F. Gomes"},{"@pid":"96/3526","text":"Dominic P. Mulligan"}]},"title":"The LambdaMu-calculus.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/MatacheGM17","ee":"https://www.isa-afp.org/entries/LambdaMu.html","url":"https://dblp.org/rec/journals/afp/MatacheGM17"},
"url":"URL#1900729"
},
{
"@score":"1",
"@id":"1900730",
"info":{"authors":{"author":[{"@pid":"207/1078","text":"Florian Messner"},{"@pid":"206/0176","text":"Julian Parsert"},{"@pid":"207/1452","text":"Jonas Schöpf"},{"@pid":"33/287","text":"Christian Sternagel"}]},"title":"Homogeneous Linear Diophantine Equations.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/MessnerPSS17","ee":"https://www.isa-afp.org/entries/Diophantine_Eqns_Lin_Hom.html","url":"https://dblp.org/rec/journals/afp/MessnerPSS17"},
"url":"URL#1900730"
},
{
"@score":"1",
"@id":"1900731",
"info":{"authors":{"author":[{"@pid":"147/1118","text":"Julius Michaelis"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Propositional Proof Systems.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/MichaelisN17","ee":"https://www.isa-afp.org/entries/Propositional_Proof_Systems.shtml","url":"https://dblp.org/rec/journals/afp/MichaelisN17"},
"url":"URL#1900731"
},
{
"@score":"1",
"@id":"1900732",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Root-Balanced Tree.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow17","ee":"https://www.isa-afp.org/entries/Root_Balanced_Tree.html","url":"https://dblp.org/rec/journals/afp/Nipkow17"},
"url":"URL#1900732"
},
{
"@score":"1",
"@id":"1900733",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"Verification of a Diffie-Hellman Password-based Authentication Protocol by Extending the Inductive Method.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce17","ee":"https://www.isa-afp.org/entries/Password_Authentication_Protocol.shtml","url":"https://dblp.org/rec/journals/afp/Noce17"},
"url":"URL#1900733"
},
{
"@score":"1",
"@id":"1900734",
"info":{"authors":{"author":{"@pid":"69/3804","text":"Steven Obua"}},"title":"Local Lexing.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Obua17","ee":"https://www.isa-afp.org/entries/LocalLexing.shtml","url":"https://dblp.org/rec/journals/afp/Obua17"},
"url":"URL#1900734"
},
{
"@score":"1",
"@id":"1900735",
"info":{"authors":{"author":[{"@pid":"206/0176","text":"Julian Parsert"},{"@pid":"30/5217","text":"Cezary Kaliszyk"}]},"title":"Microeconomics and the First Welfare Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/ParsertK17","ee":"https://www.isa-afp.org/entries/First_Welfare_Theorem.html","url":"https://dblp.org/rec/journals/afp/ParsertK17"},
"url":"URL#1900735"
},
{
"@score":"1",
"@id":"1900736",
"info":{"authors":{"author":{"@pid":"205/2283","text":"Jonas Rädle"}},"title":"Orbit-Stabiliser Theorem with Application to Rotational Symmetries.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Radle17","ee":"https://www.isa-afp.org/entries/Orbit_Stabiliser.html","url":"https://dblp.org/rec/journals/afp/Radle17"},
"url":"URL#1900736"
},
{
"@score":"1",
"@id":"1900737",
"info":{"authors":{"author":{"@pid":"203/2360","text":"Michael Rawson"}},"title":"Verified Metatheory and Type Inference for a Name-Carrying Simply-Typed Lambda Calculus.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Rawson17","ee":"https://www.isa-afp.org/entries/Name_Carrying_Type_Inference.shtml","url":"https://dblp.org/rec/journals/afp/Rawson17"},
"url":"URL#1900737"
},
{
"@score":"1",
"@id":"1900738",
"info":{"authors":{"author":[{"@pid":"173/4006","text":"Joshua Schneider 0001"},{"@pid":"139/6835","text":"Manuel Eberl"},{"@pid":"43/1499","text":"Andreas Lochbihler"}]},"title":"Monad normalisation.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/SchneiderEL17","ee":"https://www.isa-afp.org/entries/Monad_Normalisation.shtml","url":"https://dblp.org/rec/journals/afp/SchneiderEL17"},
"url":"URL#1900738"
},
{
"@score":"1",
"@id":"1900739",
"info":{"authors":{"author":{"@pid":"78/6212","text":"Jeremy G. Siek"}},"title":"Declarative Semantics for Functional Languages.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Siek17","ee":"https://www.isa-afp.org/entries/Decl_Sem_Fun_PL.shtml","url":"https://dblp.org/rec/journals/afp/Siek17"},
"url":"URL#1900739"
},
{
"@score":"1",
"@id":"1900740",
"info":{"authors":{"author":[{"@pid":"s/ChristophSprenger","text":"Christoph Sprenger 0001"},{"@pid":"200/9061","text":"Ivano Somaini"}]},"title":"Developing Security Protocols by Refinement.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/SprengerS17","ee":"https://www.isa-afp.org/entries/Security_Protocol_Refinement.shtml","url":"https://dblp.org/rec/journals/afp/SprengerS17"},
"url":"URL#1900740"
},
{
"@score":"1",
"@id":"1900741",
"info":{"authors":{"author":{"@pid":"s/EugeneWStark","text":"Eugene W. Stark"}},"title":"Monoidal Categories.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Stark17","ee":"https://www.isa-afp.org/entries/MonoidalCategory.shtml","url":"https://dblp.org/rec/journals/afp/Stark17"},
"url":"URL#1900741"
},
{
"@score":"1",
"@id":"1900742",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"Stochastic Matrices and the Perron-Frobenius Theorem.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann17","ee":"https://www.isa-afp.org/entries/Stochastic_Matrices.html","url":"https://dblp.org/rec/journals/afp/Thiemann17"},
"url":"URL#1900742"
},
{
"@score":"1",
"@id":"1900743",
"info":{"authors":{"author":[{"@pid":"194/0989","text":"Max Wagner"},{"@pid":"22/7796","text":"Denis Lohner"}]},"title":"Minimal Static Single Assignment Form.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/WagnerL17","ee":"https://www.isa-afp.org/entries/Minimal_SSA.shtml","url":"https://dblp.org/rec/journals/afp/WagnerL17"},
"url":"URL#1900743"
},
{
"@score":"1",
"@id":"1900744",
"info":{"authors":{"author":[{"@pid":"132/9797","text":"Simon Wimmer 0001"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"The Floyd-Warshall Algorithm for Shortest Paths.","venue":"Arch. Formal Proofs","volume":"2017","year":"2017","type":"Data and Artifacts","access":"open","key":"journals/afp/WimmerL17","ee":"https://www.isa-afp.org/entries/Floyd_Warshall.shtml","url":"https://dblp.org/rec/journals/afp/WimmerL17"},
"url":"URL#1900744"
},
{
"@score":"1",
"@id":"2216615",
"info":{"authors":{"author":[{"@pid":"183/9385","text":"Romain Aïssat"},{"@pid":"86/5503","text":"Frédéric Voisin"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"Infeasible Paths Elimination by Symbolic Execution Techniques - Proof of Correctness and Preservation of Paths.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/AissatVW16","ee":"https://www.isa-afp.org/entries/InfPathElimination.shtml","url":"https://dblp.org/rec/journals/afp/AissatVW16"},
"url":"URL#2216615"
},
{
"@score":"1",
"@id":"2216616",
"info":{"authors":{"author":[{"@pid":"22/11041","text":"Sidney Amani"},{"@pid":"11/6441","text":"June Andronick"},{"@pid":"69/6193","text":"Maksym Bortin"},{"@pid":"29/8396","text":"Corey Lewis"},{"@pid":"50/9861","text":"Christine Rizkallah"},{"@pid":"177/8622","text":"Joseph Tuong"}]},"title":"COMPLX - A Verification Framework for Concurrent Imperative Programs.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/AmaniABLRT16","ee":"https://www.isa-afp.org/entries/Complx.shtml","url":"https://dblp.org/rec/journals/afp/AmaniABLRT16"},
"url":"URL#2216616"
},
{
"@score":"1",
"@id":"2216617",
"info":{"authors":{"author":[{"@pid":"181/4465","text":"Fahad Ausaf"},{"@pid":"d/RoyDyckhoff","text":"Roy Dyckhoff"},{"@pid":"u/ChristianUrban","text":"Christian Urban"}]},"title":"POSIX Lexing with Derivatives of Regular Expressions.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/AusafDU16","ee":"https://www.isa-afp.org/entries/Posix-Lexing.shtml","url":"https://dblp.org/rec/journals/afp/AusafDU16"},
"url":"URL#2216617"
},
{
"@score":"1",
"@id":"2216618",
"info":{"authors":{"author":[{"@pid":"180/4436","text":"Heiko Becker"},{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"w/UweWaldmann","text":"Uwe Waldmann"},{"@pid":"117/3575","text":"Daniel Wand"}]},"title":"Formalization of Knuth-Bendix Orders for Lambda-Free Higher-Order Terms.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/BeckerBWW16","ee":"https://www.isa-afp.org/entries/Lambda_Free_KBOs.shtml","url":"https://dblp.org/rec/journals/afp/BeckerBWW16"},
"url":"URL#2216618"
},
{
"@score":"1",
"@id":"2216619",
"info":{"authors":{"author":[{"@pid":"177/8596","text":"Joel Beeren"},{"@pid":"135/9600","text":"Matthew Fernandez"},{"@pid":"56/2203","text":"Xin Gao"},{"@pid":"74/2171","text":"Gerwin Klein"},{"@pid":"87/2179","text":"Rafal Kolanski"},{"@pid":"145/1087","text":"Japheth Lim"},{"@pid":"29/8396","text":"Corey Lewis"},{"@pid":"119/1553","text":"Daniel Matichuk"},{"@pid":"98/1593","text":"Thomas Sewell"}]},"title":"Finite Machine Word Library.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/BeerenFGKKLLMS16","ee":"https://www.isa-afp.org/entries/Word_Lib.shtml","url":"https://dblp.org/rec/journals/afp/BeerenFGKKLLMS16"},
"url":"URL#2216619"
},
{
"@score":"1",
"@id":"2216620",
"info":{"authors":{"author":{"@pid":"172/8673","text":"Alexander Bentkamp"}},"title":"Expressiveness of Deep Learning.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bentkamp16","ee":"https://www.isa-afp.org/entries/Deep_Learning.shtml","url":"https://dblp.org/rec/journals/afp/Bentkamp16"},
"url":"URL#2216620"
},
{
"@score":"1",
"@id":"2216621",
"info":{"authors":{"author":[{"@pid":"181/4548","text":"Benjamin Bisping"},{"@pid":"181/4578","text":"Paul-David Brodmann"},{"@pid":"173/5042","text":"Tim Jungnickel"},{"@pid":"118/4908","text":"Christina Rickmann"},{"@pid":"181/4489","text":"Henning Seidler"},{"@pid":"150/0062","text":"Anke Stüber"},{"@pid":"167/9956","text":"Arno Wilhelm-Weidner"},{"@pid":"27/4654","text":"Kirstin Peters"},{"@pid":"n/UweNestmann","text":"Uwe Nestmann"}]},"title":"A Constructive Proof for FLP.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/BispingBJRSSWPN16","ee":"https://www.isa-afp.org/entries/FLP.shtml","url":"https://dblp.org/rec/journals/afp/BispingBJRSSWPN16"},
"url":"URL#2216621"
},
{
"@score":"1",
"@id":"2216622",
"info":{"authors":{"author":[{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"175/3307","text":"Mathias Fleury"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Formalization of Nested Multisets, Hereditary Multisets, and Syntactic Ordinals.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/BlanchetteFT16","ee":"https://www.isa-afp.org/entries/Nested_Multisets_Ordinals.shtml","url":"https://dblp.org/rec/journals/afp/BlanchetteFT16"},
"url":"URL#2216622"
},
{
"@score":"1",
"@id":"2216623",
"info":{"authors":{"author":[{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"w/UweWaldmann","text":"Uwe Waldmann"},{"@pid":"117/3575","text":"Daniel Wand"}]},"title":"Formalization of Recursive Path Orders for Lambda-Free Higher-Order Terms.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/BlanchetteWW16","ee":"https://www.isa-afp.org/entries/Lambda_Free_RPOs.shtml","url":"https://dblp.org/rec/journals/afp/BlanchetteWW16"},
"url":"URL#2216623"
},
{
"@score":"1",
"@id":"2216624",
"info":{"authors":{"author":{"@pid":"69/6193","text":"Maksym Bortin"}},"title":"A formalisation of the Cocke-Younger-Kasami algorithm.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bortin16","ee":"https://www.isa-afp.org/entries/CYK.shtml","url":"https://dblp.org/rec/journals/afp/Bortin16"},
"url":"URL#2216624"
},
{
"@score":"1",
"@id":"2216625",
"info":{"authors":{"author":{"@pid":"80/9827","text":"Joachim Breitner"}},"title":"Surprise Paradox.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Breitner16","ee":"https://www.isa-afp.org/entries/Surprise_Paradox.shtml","url":"https://dblp.org/rec/journals/afp/Breitner16"},
"url":"URL#2216625"
},
{
"@score":"1",
"@id":"2216626",
"info":{"authors":{"author":[{"@pid":"80/9827","text":"Joachim Breitner"},{"@pid":"22/7796","text":"Denis Lohner"}]},"title":"The meta theory of the Incredible Proof Machine.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/BreitnerL16","ee":"https://www.isa-afp.org/entries/Incredible_Proof_Machine.shtml","url":"https://dblp.org/rec/journals/afp/BreitnerL16"},
"url":"URL#2216626"
},
{
"@score":"1",
"@id":"2216627",
"info":{"authors":{"author":[{"@pid":"192/5472","text":"Hauke Brinkop"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Pairing Heap.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/BrinkopN16","ee":"https://www.isa-afp.org/entries/Pairing_Heap.shtml","url":"https://dblp.org/rec/journals/afp/BrinkopN16"},
"url":"URL#2216627"
},
{
"@score":"1",
"@id":"2216628",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Cardinality of Number Partitions.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn16","ee":"https://www.isa-afp.org/entries/Card_Number_Partitions.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn16"},
"url":"URL#2216628"
},
{
"@score":"1",
"@id":"2216629",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Spivey's Generalized Recurrence for Bell Numbers.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn16a","ee":"https://www.isa-afp.org/entries/Bell_Numbers_Spivey.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn16a"},
"url":"URL#2216629"
},
{
"@score":"1",
"@id":"2216630",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Cardinality of Equivalence Relations.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn16b","ee":"https://www.isa-afp.org/entries/Card_Equiv_Relations.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn16b"},
"url":"URL#2216630"
},
{
"@score":"1",
"@id":"2216631",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Cardinality of Multisets.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn16c","ee":"https://www.isa-afp.org/entries/Card_Multisets.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn16c"},
"url":"URL#2216631"
},
{
"@score":"1",
"@id":"2216632",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Ptolemy's Theorem.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn16d","ee":"https://www.isa-afp.org/entries/Ptolemys_Theorem.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn16d"},
"url":"URL#2216632"
},
{
"@score":"1",
"@id":"2216633",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Intersecting Chords Theorem.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn16e","ee":"https://www.isa-afp.org/entries/Chord_Segments.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn16e"},
"url":"URL#2216633"
},
{
"@score":"1",
"@id":"2216634",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"The Twelvefold Way.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn16f","ee":"https://www.isa-afp.org/entries/Twelvefold_Way.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn16f"},
"url":"URL#2216634"
},
{
"@score":"1",
"@id":"2216635",
"info":{"authors":{"author":[{"@pid":"140/7089","text":"Cornelius Diekmann"},{"@pid":"143/3168","text":"Lars Hupel"}]},"title":"Iptables_Semantics.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/DiekmannH16","ee":"https://www.isa-afp.org/entries/Iptables_Semantics.shtml","url":"https://dblp.org/rec/journals/afp/DiekmannH16"},
"url":"URL#2216635"
},
{
"@score":"1",
"@id":"2216636",
"info":{"authors":{"author":[{"@pid":"140/7089","text":"Cornelius Diekmann"},{"@pid":"147/1118","text":"Julius Michaelis"},{"@pid":"143/3168","text":"Lars Hupel"}]},"title":"IP Addresses.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/DiekmannMH16","ee":"https://www.isa-afp.org/entries/IP_Addresses.shtml","url":"https://dblp.org/rec/journals/afp/DiekmannMH16"},
"url":"URL#2216636"
},
{
"@score":"1",
"@id":"2216637",
"info":{"authors":{"author":[{"@pid":"140/7089","text":"Cornelius Diekmann"},{"@pid":"147/1118","text":"Julius Michaelis"},{"@pid":"222/4355","text":"Max W. Haslbeck"}]},"title":"Simple Firewall.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/DiekmannMH16a","ee":"https://www.isa-afp.org/entries/Simple_Firewall.shtml","url":"https://dblp.org/rec/journals/afp/DiekmannMH16a"},
"url":"URL#2216637"
},
{
"@score":"1",
"@id":"2216638",
"info":{"authors":{"author":{"@pid":"117/9280","text":"Christoph Dittmann"}},"title":"Tree Decomposition.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Dittmann16","ee":"https://www.isa-afp.org/entries/Tree_Decomposition.shtml","url":"https://dblp.org/rec/journals/afp/Dittmann16"},
"url":"URL#2216638"
},
{
"@score":"1",
"@id":"2216639",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"129/1473","text":"Sebastiaan J. C. Joosten"},{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"The Factorization Algorithm of Berlekamp and Zassenhaus.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonJTY16","ee":"https://www.isa-afp.org/entries/Berlekamp_Zassenhaus.shtml","url":"https://dblp.org/rec/journals/afp/DivasonJTY16"},
"url":"URL#2216639"
},
{
"@score":"1",
"@id":"2216640",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"46/9960","text":"Ondrej Kuncar"},{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"Perron-Frobenius Theorem for Spectral Radius Analysis.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonKTY16","ee":"https://www.isa-afp.org/entries/Perron_Frobenius.shtml","url":"https://dblp.org/rec/journals/afp/DivasonKTY16"},
"url":"URL#2216640"
},
{
"@score":"1",
"@id":"2216641",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Incompatibility of SD-Efficiency and SD-Strategy-Proofness.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl16","ee":"https://www.isa-afp.org/entries/SDS_Impossibility.shtml","url":"https://dblp.org/rec/journals/afp/Eberl16"},
"url":"URL#2216641"
},
{
"@score":"1",
"@id":"2216642",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Randomised Social Choice Theory.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl16a","ee":"https://www.isa-afp.org/entries/Randomised_Social_Choice.shtml","url":"https://dblp.org/rec/journals/afp/Eberl16a"},
"url":"URL#2216642"
},
{
"@score":"1",
"@id":"2216643",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Catalan Numbers.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl16b","ee":"https://www.isa-afp.org/entries/Catalan_Numbers.shtml","url":"https://dblp.org/rec/journals/afp/Eberl16b"},
"url":"URL#2216643"
},
{
"@score":"1",
"@id":"2216644",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Stirling's formula.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl16c","ee":"https://www.isa-afp.org/entries/Stirling_Formula.shtml","url":"https://dblp.org/rec/journals/afp/Eberl16c"},
"url":"URL#2216644"
},
{
"@score":"1",
"@id":"2216645",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Fisher-Yates shuffle.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl16d","ee":"https://www.isa-afp.org/entries/Fisher_Yates.shtml","url":"https://dblp.org/rec/journals/afp/Eberl16d"},
"url":"URL#2216645"
},
{
"@score":"1",
"@id":"2216646",
"info":{"authors":{"author":[{"@pid":"72/9638","text":"Bertram Felgenhauer"},{"@pid":"62/11440","text":"Julian Nagele"},{"@pid":"69/3031","text":"Vincent van Oostrom"},{"@pid":"33/287","text":"Christian Sternagel"}]},"title":"The Z Property.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/FelgenhauerNOS16","ee":"https://www.isa-afp.org/entries/Rewriting_Z.shtml","url":"https://dblp.org/rec/journals/afp/FelgenhauerNOS16"},
"url":"URL#2216646"
},
{
"@score":"1",
"@id":"2216647",
"info":{"authors":{"author":[{"@pid":"192/6965","text":"Julian Fell"},{"@pid":"h/IanJHayes","text":"Ian J. Hayes"},{"@pid":"10/8372","text":"Andrius Velykis"}]},"title":"Concurrent Refinement Algebra and Rely Quotients.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/FellHV16","ee":"https://www.isa-afp.org/entries/Concurrent_Ref_Alg.shtml","url":"https://dblp.org/rec/journals/afp/FellHV16"},
"url":"URL#2216647"
},
{
"@score":"1",
"@id":"2216648",
"info":{"authors":{"author":{"@pid":"20/6956","text":"Peter Gammie"}},"title":"Stable Matching.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Gammie16","ee":"https://www.isa-afp.org/entries/Stable_Matching.shtml","url":"https://dblp.org/rec/journals/afp/Gammie16"},
"url":"URL#2216648"
},
{
"@score":"1",
"@id":"2216649",
"info":{"authors":{"author":{"@pid":"53/5823","text":"Fadoua Ghourabi"}},"title":"Allen's Interval Calculus.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Ghourabi16","ee":"https://www.isa-afp.org/entries/Allen_Calculus.shtml","url":"https://dblp.org/rec/journals/afp/Ghourabi16"},
"url":"URL#2216649"
},
{
"@score":"1",
"@id":"2216650",
"info":{"authors":{"author":[{"@pid":"139/0605","text":"Victor B. F. Gomes"},{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"},{"@pid":"98/7040","text":"Peter Höfner"},{"@pid":"57/4783","text":"Georg Struth"},{"@pid":"56/3934","text":"Tjark Weber"}]},"title":"Kleene Algebras with Domain.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/GomesGHSW16","ee":"https://www.isa-afp.org/entries/KAD.shtml","url":"https://dblp.org/rec/journals/afp/GomesGHSW16"},
"url":"URL#2216650"
},
{
"@score":"1",
"@id":"2216651",
"info":{"authors":{"author":[{"@pid":"139/0605","text":"Victor B. F. Gomes"},{"@pid":"57/4783","text":"Georg Struth"}]},"title":"Program Construction and Verification Components Based on Kleene Algebra.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/GomesS16","ee":"https://www.isa-afp.org/entries/Algebraic_VCs.shtml","url":"https://dblp.org/rec/journals/afp/GomesS16"},
"url":"URL#2216651"
},
{
"@score":"1",
"@id":"2216652",
"info":{"authors":{"author":{"@pid":"168/5699","text":"Sebastien Gouezel"}},"title":"Lp spaces.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Gouezel16","ee":"https://www.isa-afp.org/entries/Lp.shtml","url":"https://dblp.org/rec/journals/afp/Gouezel16"},
"url":"URL#2216652"
},
{
"@score":"1",
"@id":"2216653",
"info":{"authors":{"author":{"@pid":"g/WalterGuttmann","text":"Walter Guttmann"}},"title":"Stone Algebras.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Guttmann16","ee":"https://www.isa-afp.org/entries/Stone_Algebras.shtml","url":"https://dblp.org/rec/journals/afp/Guttmann16"},
"url":"URL#2216653"
},
{
"@score":"1",
"@id":"2216654",
"info":{"authors":{"author":[{"@pid":"134/6302","text":"Maximilian P. L. Haslbeck"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Analysis of List Update Algorithms.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/HaslbeckN16","ee":"https://www.isa-afp.org/entries/List_Update.shtml","url":"https://dblp.org/rec/journals/afp/HaslbeckN16"},
"url":"URL#2216654"
},
{
"@score":"1",
"@id":"2216655",
"info":{"authors":{"author":[{"@pid":"187/8361","text":"Quentin Hibon"},{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}]},"title":"Source Coding Theorem.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/HibonP16","ee":"https://www.isa-afp.org/entries/Source_Coding_Theorem.shtml","url":"https://dblp.org/rec/journals/afp/HibonP16"},
"url":"URL#2216655"
},
{
"@score":"1",
"@id":"2216656",
"info":{"authors":{"author":[{"@pid":"76/5461","text":"Zhe Hou"},{"@pid":"22/111","text":"David Sanán"},{"@pid":"t/AlwenTiu","text":"Alwen Tiu"},{"@pid":"g/RajeevGore","text":"Rajeev Goré"},{"@pid":"27/6932","text":"Ranald Clouston"}]},"title":"Separata - Isabelle tactics for Separation Algebra.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/HouSTGC16","ee":"https://www.isa-afp.org/entries/Separata.shtml","url":"https://dblp.org/rec/journals/afp/HouSTGC16"},
"url":"URL#2216656"
},
{
"@score":"1",
"@id":"2216657",
"info":{"authors":{"author":[{"@pid":"76/5461","text":"Zhe Hou"},{"@pid":"22/111","text":"David Sanán"},{"@pid":"t/AlwenTiu","text":"Alwen Tiu"},{"@pid":"51/3710-3","text":"Yang Liu 0003"}]},"title":"A formal model for the SPARCv8 ISA and a proof of non-interference for the LEON3 processor.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/HouSTL16","ee":"https://www.isa-afp.org/entries/SPARCv8.shtml","url":"https://dblp.org/rec/journals/afp/HouSTL16"},
"url":"URL#2216657"
},
{
"@score":"1",
"@id":"2216658",
"info":{"authors":{"author":[{"@pid":"47/11065","text":"Fabian Immler"},{"@pid":"149/2436","text":"Alexander Maletzky"}]},"title":"Gröbner Bases Theory.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/ImmlerM16","ee":"https://www.isa-afp.org/entries/Groebner_Bases.shtml","url":"https://dblp.org/rec/journals/afp/ImmlerM16"},
"url":"URL#2216658"
},
{
"@score":"1",
"@id":"2216659",
"info":{"authors":{"author":{"@pid":"49/5258","text":"Peter Lammich"}},"title":"The Imperative Refinement Framework.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Lammich16","ee":"https://www.isa-afp.org/entries/Refine_Imperative_HOL.shtml","url":"https://dblp.org/rec/journals/afp/Lammich16"},
"url":"URL#2216659"
},
{
"@score":"1",
"@id":"2216660",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"88/11065","text":"René Neumann"}]},"title":"A Framework for Verifying Depth-First Search Algorithms.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichN16","ee":"https://www.isa-afp.org/entries/DFS_Framework.shtml","url":"https://dblp.org/rec/journals/afp/LammichN16"},
"url":"URL#2216660"
},
{
"@score":"1",
"@id":"2216661",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"183/9400","text":"S. Reza Sefidgar"}]},"title":"Formalizing the Edmonds-Karp Algorithm.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichS16","ee":"https://www.isa-afp.org/entries/EdmondsKarp_Maxflow.shtml","url":"https://dblp.org/rec/journals/afp/LammichS16"},
"url":"URL#2216661"
},
{
"@score":"1",
"@id":"2216662",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"A Formal Proof of the Max-Flow Min-Cut Theorem for Countable Networks.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler16","ee":"https://www.isa-afp.org/entries/MFMC_Countable.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler16"},
"url":"URL#2216662"
},
{
"@score":"1",
"@id":"2216663",
"info":{"authors":{"author":[{"@pid":"147/1118","text":"Julius Michaelis"},{"@pid":"140/7089","text":"Cornelius Diekmann"}]},"title":"Routing.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/MichaelisD16","ee":"https://www.isa-afp.org/entries/Routing.shtml","url":"https://dblp.org/rec/journals/afp/MichaelisD16"},
"url":"URL#2216663"
},
{
"@score":"1",
"@id":"2216664",
"info":{"authors":{"author":[{"@pid":"147/1118","text":"Julius Michaelis"},{"@pid":"140/7089","text":"Cornelius Diekmann"}]},"title":"LOFT - Verified Migration of Linux Firewalls to SDN.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/MichaelisD16a","ee":"https://www.isa-afp.org/entries/LOFT.shtml","url":"https://dblp.org/rec/journals/afp/MichaelisD16a"},
"url":"URL#2216664"
},
{
"@score":"1",
"@id":"2216665",
"info":{"authors":{"author":[{"@pid":"147/1118","text":"Julius Michaelis"},{"@pid":"222/4355","text":"Max W. Haslbeck"},{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"143/3168","text":"Lars Hupel"}]},"title":"Algorithms for Reduced Ordered Binary Decision Diagrams.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/MichaelisHLH16","ee":"https://www.isa-afp.org/entries/ROBDD.shtml","url":"https://dblp.org/rec/journals/afp/MichaelisHLH16"},
"url":"URL#2216665"
},
{
"@score":"1",
"@id":"2216666",
"info":{"authors":{"author":[{"@pid":"31/6289","text":"Toby C. Murray"},{"@pid":"182/4864","text":"Robert Sison"},{"@pid":"160/8059","text":"Edward Pierzchalski"},{"@pid":"50/9861","text":"Christine Rizkallah"}]},"title":"A Dependent Security Type System for Concurrent Imperative Programs.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/MurraySPR16","ee":"https://www.isa-afp.org/entries/Dependent_SIFUM_Type_Systems.shtml","url":"https://dblp.org/rec/journals/afp/MurraySPR16"},
"url":"URL#2216666"
},
{
"@score":"1",
"@id":"2216667",
"info":{"authors":{"author":[{"@pid":"31/6289","text":"Toby C. Murray"},{"@pid":"182/4864","text":"Robert Sison"},{"@pid":"160/8059","text":"Edward Pierzchalski"},{"@pid":"50/9861","text":"Christine Rizkallah"}]},"title":"Compositional Security-Preserving Refinement for Concurrent Imperative Programs.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/MurraySPR16a","ee":"https://www.isa-afp.org/entries/Dependent_SIFUM_Refinement.shtml","url":"https://dblp.org/rec/journals/afp/MurraySPR16a"},
"url":"URL#2216667"
},
{
"@score":"1",
"@id":"2216668",
"info":{"authors":{"author":{"@pid":"21/607","text":"Yutaka Nagashima"}},"title":"Proof Strategy Language.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Nagashima16","ee":"https://www.isa-afp.org/entries/Proof_Strategy_Language.shtml","url":"https://dblp.org/rec/journals/afp/Nagashima16"},
"url":"URL#2216668"
},
{
"@score":"1",
"@id":"2216669",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Abstract Interpretation of Annotated Commands.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow16","ee":"https://www.isa-afp.org/entries/Abs_Int_ITP2012.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow16"},
"url":"URL#2216669"
},
{
"@score":"1",
"@id":"2216670",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"Conservation of CSP Noninterference Security under Sequential Composition.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce16","ee":"https://www.isa-afp.org/entries/Noninterference_Sequential_Composition.shtml","url":"https://dblp.org/rec/journals/afp/Noce16"},
"url":"URL#2216670"
},
{
"@score":"1",
"@id":"2216671",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"Conservation of CSP Noninterference Security under Concurrent Composition.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce16a","ee":"https://www.isa-afp.org/entries/Noninterference_Concurrent_Composition.shtml","url":"https://dblp.org/rec/journals/afp/Noce16a"},
"url":"URL#2216671"
},
{
"@score":"1",
"@id":"2216672",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"The Cartan Fixed Point Theorems.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson16","ee":"https://www.isa-afp.org/entries/Cartan_FP.shtml","url":"https://dblp.org/rec/journals/afp/Paulson16"},
"url":"URL#2216672"
},
{
"@score":"1",
"@id":"2216673",
"info":{"authors":{"author":{"@pid":"84/5281","text":"Nicolas Peltier"}},"title":"Propositional Resolution and Prime Implicates Generation.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Peltier16","ee":"https://www.isa-afp.org/entries/PropResPI.shtml","url":"https://dblp.org/rec/journals/afp/Peltier16"},
"url":"URL#2216673"
},
{
"@score":"1",
"@id":"2216674",
"info":{"authors":{"author":{"@pid":"84/5281","text":"Nicolas Peltier"}},"title":"A Variant of the Superposition Calculus.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Peltier16a","ee":"https://www.isa-afp.org/entries/SuperCalc.shtml","url":"https://dblp.org/rec/journals/afp/Peltier16a"},
"url":"URL#2216674"
},
{
"@score":"1",
"@id":"2216675",
"info":{"authors":{"author":{"@pid":"167/1643","text":"T. V. H. Prathamesh"}},"title":"Tensor Product of Matrices.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Prathamesh16","ee":"https://www.isa-afp.org/entries/Matrix_Tensor.shtml","url":"https://dblp.org/rec/journals/afp/Prathamesh16"},
"url":"URL#2216675"
},
{
"@score":"1",
"@id":"2216676",
"info":{"authors":{"author":{"@pid":"167/1643","text":"T. V. H. Prathamesh"}},"title":"Knot Theory.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Prathamesh16a","ee":"https://www.isa-afp.org/entries/Knot_Theory.shtml","url":"https://dblp.org/rec/journals/afp/Prathamesh16a"},
"url":"URL#2216676"
},
{
"@score":"1",
"@id":"2216677",
"info":{"authors":{"author":{"@pid":"166/1371","text":"Anders Schlichtkrull"}},"title":"The Resolution Calculus for First-Order Logic.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Schlichtkrull16","ee":"https://www.isa-afp.org/entries/Resolution_FOL.shtml","url":"https://dblp.org/rec/journals/afp/Schlichtkrull16"},
"url":"URL#2216677"
},
{
"@score":"1",
"@id":"2216678",
"info":{"authors":{"author":[{"@pid":"166/1371","text":"Anders Schlichtkrull"},{"@pid":"v/JorgenVilladsen","text":"Jørgen Villadsen"}]},"title":"Paraconsistency.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/SchlichtkrullV16","ee":"https://www.isa-afp.org/entries/Paraconsistency.shtml","url":"https://dblp.org/rec/journals/afp/SchlichtkrullV16"},
"url":"URL#2216678"
},
{
"@score":"1",
"@id":"2216679",
"info":{"authors":{"author":{"@pid":"129/1369","text":"Salomon Sickert"}},"title":"Linear Temporal Logic.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Sickert16","ee":"https://www.isa-afp.org/entries/LTL.shtml","url":"https://dblp.org/rec/journals/afp/Sickert16"},
"url":"URL#2216679"
},
{
"@score":"1",
"@id":"2216680",
"info":{"authors":{"author":[{"@pid":"45/4040","text":"Mike Stannett"},{"@pid":"68/6521","text":"István Németi"}]},"title":"No Faster-Than-Light Observers.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/StannettN16","ee":"https://www.isa-afp.org/entries/No_FTL_observers.shtml","url":"https://dblp.org/rec/journals/afp/StannettN16"},
"url":"URL#2216680"
},
{
"@score":"1",
"@id":"2216681",
"info":{"authors":{"author":{"@pid":"s/EugeneWStark","text":"Eugene W. Stark"}},"title":"Category Theory with Adjunctions and Limits.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Stark16","ee":"https://www.isa-afp.org/entries/Category3.shtml","url":"https://dblp.org/rec/journals/afp/Stark16"},
"url":"URL#2216681"
},
{
"@score":"1",
"@id":"2216682",
"info":{"authors":{"author":{"@pid":"166/9623","text":"Jeremy Sylvestre"}},"title":"Chamber Complexes, Coxeter Systems, and Buildings.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Sylvestre16","ee":"https://www.isa-afp.org/entries/Buildings.shtml","url":"https://dblp.org/rec/journals/afp/Sylvestre16"},
"url":"URL#2216682"
},
{
"@score":"1",
"@id":"2216683",
"info":{"authors":{"author":[{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"Polynomial Factorization.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann016","ee":"https://www.isa-afp.org/entries/Polynomial_Factorization.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann016"},
"url":"URL#2216683"
},
{
"@score":"1",
"@id":"2216684",
"info":{"authors":{"author":[{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"Polynomial Interpolation.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann016a","ee":"https://www.isa-afp.org/entries/Polynomial_Interpolation.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann016a"},
"url":"URL#2216684"
},
{
"@score":"1",
"@id":"2216685",
"info":{"authors":{"author":[{"@pid":"76/3968-2","text":"Sebastian Ullrich 0002"},{"@pid":"22/7796","text":"Denis Lohner"}]},"title":"Verified Construction of Static Single Assignment Form.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/UllrichL16","ee":"https://www.isa-afp.org/entries/Formal_SSA.shtml","url":"https://dblp.org/rec/journals/afp/UllrichL16"},
"url":"URL#2216685"
},
{
"@score":"1",
"@id":"2216686",
"info":{"authors":{"author":[{"@pid":"56/3934","text":"Tjark Weber"},{"@pid":"54/4160","text":"Lars-Henrik Eriksson"},{"@pid":"91/6350","text":"Joachim Parrow"},{"@pid":"38/2005","text":"Johannes Borgström"},{"@pid":"141/6330","text":"Ramunas Gutkovas"}]},"title":"Modal Logics for Nominal Transition Systems.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/WeberEPBG16","ee":"https://www.isa-afp.org/entries/Modal_Logics_for_NTS.shtml","url":"https://dblp.org/rec/journals/afp/WeberEPBG16"},
"url":"URL#2216686"
},
{
"@score":"1",
"@id":"2216687",
"info":{"authors":{"author":{"@pid":"132/9797","text":"Simon Wimmer 0001"}},"title":"Timed Automata.","venue":"Arch. Formal Proofs","volume":"2016","year":"2016","type":"Data and Artifacts","access":"open","key":"journals/afp/Wimmer16","ee":"https://www.isa-afp.org/entries/Timed_Automata.shtml","url":"https://dblp.org/rec/journals/afp/Wimmer16"},
"url":"URL#2216687"
},
{
"@score":"1",
"@id":"2518851",
"info":{"authors":{"author":{"@pid":"172/8673","text":"Alexander Bentkamp"}},"title":"Latin Square.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Bentkamp15","ee":"https://www.isa-afp.org/entries/Latin_Square.shtml","url":"https://dblp.org/rec/journals/afp/Bentkamp15"},
"url":"URL#2518851"
},
{
"@score":"1",
"@id":"2518852",
"info":{"authors":{"author":{"@pid":"80/9827","text":"Joachim Breitner"}},"title":"The Safety of Call Arity.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Breitner15","ee":"https://www.isa-afp.org/entries/Call_Arity.shtml","url":"https://dblp.org/rec/journals/afp/Breitner15"},
"url":"URL#2518852"
},
{
"@score":"1",
"@id":"2518853",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Derangements Formula.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn15","ee":"https://www.isa-afp.org/entries/Derangements.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn15"},
"url":"URL#2518853"
},
{
"@score":"1",
"@id":"2518854",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Euler's Partition Theorem.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn15a","ee":"https://www.isa-afp.org/entries/Euler_Partition.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn15a"},
"url":"URL#2518854"
},
{
"@score":"1",
"@id":"2518855",
"info":{"authors":{"author":{"@pid":"36/4781","text":"Lukas Bulwahn"}},"title":"Cardinality of Set Partitions.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Bulwahn15b","ee":"https://www.isa-afp.org/entries/Card_Partitions.shtml","url":"https://dblp.org/rec/journals/afp/Bulwahn15b"},
"url":"URL#2518855"
},
{
"@score":"1",
"@id":"2518856",
"info":{"authors":{"author":[{"@pid":"57/11274","text":"Marco B. Caminati"},{"@pid":"k/ManfredKerber","text":"Manfred Kerber"},{"@pid":"l/ChristophLange2","text":"Christoph Lange 0002"},{"@pid":"51/9935","text":"Colin Rowat"}]},"title":"VCG - Combinatorial Vickrey-Clarke-Groves Auctions.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/CaminatiK0R15","ee":"https://www.isa-afp.org/entries/Vickrey_Clarke_Groves.shtml","url":"https://dblp.org/rec/journals/afp/CaminatiK0R15"},
"url":"URL#2518856"
},
{
"@score":"1",
"@id":"2518857",
"info":{"authors":{"author":{"@pid":"117/9280","text":"Christoph Dittmann"}},"title":"Positional Determinacy of Parity Games.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Dittmann15","ee":"https://www.isa-afp.org/entries/Parity_Game.shtml","url":"https://dblp.org/rec/journals/afp/Dittmann15"},
"url":"URL#2518857"
},
{
"@score":"1",
"@id":"2518858",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"78/7015","text":"Jesús Aransay"}]},"title":"QR Decomposition.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonA15","ee":"https://www.isa-afp.org/entries/QR_Decomposition.shtml","url":"https://dblp.org/rec/journals/afp/DivasonA15"},
"url":"URL#2518858"
},
{
"@score":"1",
"@id":"2518859",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"78/7015","text":"Jesús Aransay"}]},"title":"Echelon Form.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonA15a","ee":"https://www.isa-afp.org/entries/Echelon_Form.shtml","url":"https://dblp.org/rec/journals/afp/DivasonA15a"},
"url":"URL#2518859"
},
{
"@score":"1",
"@id":"2518860",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"78/7015","text":"Jesús Aransay"}]},"title":"Hermite Normal Form.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonA15b","ee":"https://www.isa-afp.org/entries/Hermite.shtml","url":"https://dblp.org/rec/journals/afp/DivasonA15b"},
"url":"URL#2518860"
},
{
"@score":"1",
"@id":"2518861",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Akra-Bazzi theorem and the Master theorem.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl15","ee":"https://www.isa-afp.org/entries/Akra_Bazzi.shtml","url":"https://dblp.org/rec/journals/afp/Eberl15"},
"url":"URL#2518861"
},
{
"@score":"1",
"@id":"2518862",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Landau Symbols.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl15a","ee":"https://www.isa-afp.org/entries/Landau_Symbols.shtml","url":"https://dblp.org/rec/journals/afp/Eberl15a"},
"url":"URL#2518862"
},
{
"@score":"1",
"@id":"2518863",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Descartes' Rule of Signs.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl15b","ee":"https://www.isa-afp.org/entries/Descartes_Sign_Rule.shtml","url":"https://dblp.org/rec/journals/afp/Eberl15b"},
"url":"URL#2518863"
},
{
"@score":"1",
"@id":"2518864",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"The Divergence of the Prime Harmonic Series.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl15c","ee":"https://www.isa-afp.org/entries/Prime_Harmonic_Series.shtml","url":"https://dblp.org/rec/journals/afp/Eberl15c"},
"url":"URL#2518864"
},
{
"@score":"1",
"@id":"2518865",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Basic Geometric Properties of Triangles.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl15d","ee":"https://www.isa-afp.org/entries/Triangle.shtml","url":"https://dblp.org/rec/journals/afp/Eberl15d"},
"url":"URL#2518865"
},
{
"@score":"1",
"@id":"2518866",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Liouville numbers.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl15e","ee":"https://www.isa-afp.org/entries/Liouville_Numbers.shtml","url":"https://dblp.org/rec/journals/afp/Eberl15e"},
"url":"URL#2518866"
},
{
"@score":"1",
"@id":"2518867",
"info":{"authors":{"author":{"@pid":"72/9638","text":"Bertram Felgenhauer"}},"title":"Decreasing Diagrams II.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Felgenhauer15","ee":"https://www.isa-afp.org/entries/Decreasing-Diagrams-II.shtml","url":"https://dblp.org/rec/journals/afp/Felgenhauer15"},
"url":"URL#2518867"
},
{
"@score":"1",
"@id":"2518868",
"info":{"authors":{"author":[{"@pid":"75/3266","text":"Hitoshi Furusawa"},{"@pid":"57/4783","text":"Georg Struth"}]},"title":"Binary Multirelations.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/FurusawaS15","ee":"https://www.isa-afp.org/entries/Multirelations.shtml","url":"https://dblp.org/rec/journals/afp/FurusawaS15"},
"url":"URL#2518868"
},
{
"@score":"1",
"@id":"2518869",
"info":{"authors":{"author":{"@pid":"20/6956","text":"Peter Gammie"}},"title":"Concurrent IMP.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Gammie15","ee":"https://www.isa-afp.org/entries/ConcurrentIMP.shtml","url":"https://dblp.org/rec/journals/afp/Gammie15"},
"url":"URL#2518869"
},
{
"@score":"1",
"@id":"2518870",
"info":{"authors":{"author":[{"@pid":"20/6956","text":"Peter Gammie"},{"@pid":"h/AntonyLHosking","text":"Tony Hosking"},{"@pid":"54/1933","text":"Kai Engelhardt"}]},"title":"Relaxing Safely - Verified On-the-Fly Garbage Collection for x86-TSO.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/GammieHE15","ee":"https://www.isa-afp.org/entries/ConcurrentGC.shtml","url":"https://dblp.org/rec/journals/afp/GammieHE15"},
"url":"URL#2518870"
},
{
"@score":"1",
"@id":"2518871",
"info":{"authors":{"author":[{"@pid":"20/6956","text":"Peter Gammie"},{"@pid":"43/1499","text":"Andreas Lochbihler"}]},"title":"The Stern-Brocot Tree.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/GammieL15","ee":"https://www.isa-afp.org/entries/Stern_Brocot.shtml","url":"https://dblp.org/rec/journals/afp/GammieL15"},
"url":"URL#2518871"
},
{
"@score":"1",
"@id":"2518872",
"info":{"authors":{"author":[{"@pid":"139/0605","text":"Victor B. F. Gomes"},{"@pid":"57/4783","text":"Georg Struth"}]},"title":"Residuated Lattices.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/GomesS15","ee":"https://www.isa-afp.org/entries/Residuated_Lattices.shtml","url":"https://dblp.org/rec/journals/afp/GomesS15"},
"url":"URL#2518872"
},
{
"@score":"1",
"@id":"2518873",
"info":{"authors":{"author":{"@pid":"21/8611","text":"Johannes Hölzl"}},"title":"Verification of the UpDown Scheme.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Holzl15","ee":"https://www.isa-afp.org/entries/UpDown_Scheme.shtml","url":"https://dblp.org/rec/journals/afp/Holzl15"},
"url":"URL#2518873"
},
{
"@score":"1",
"@id":"2518874",
"info":{"authors":{"author":[{"@pid":"21/8611","text":"Johannes Hölzl"},{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"A Zoo of Probabilistic Systems.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/HolzlLT15","ee":"https://www.isa-afp.org/entries/Probabilistic_System_Zoo.shtml","url":"https://dblp.org/rec/journals/afp/HolzlLT15"},
"url":"URL#2518874"
},
{
"@score":"1",
"@id":"2518875",
"info":{"authors":{"author":[{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Trie.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/LochbihlerN15","ee":"https://www.isa-afp.org/entries/Trie.shtml","url":"https://dblp.org/rec/journals/afp/LochbihlerN15"},
"url":"URL#2518875"
},
{
"@score":"1",
"@id":"2518876",
"info":{"authors":{"author":[{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"173/4006","text":"Joshua Schneider 0001"}]},"title":"Applicative Lifting.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/LochbihlerS15","ee":"https://www.isa-afp.org/entries/Applicative_Lifting.shtml","url":"https://dblp.org/rec/journals/afp/LochbihlerS15"},
"url":"URL#2518876"
},
{
"@score":"1",
"@id":"2518877",
"info":{"authors":{"author":[{"@pid":"31/6410","text":"Ognjen Maric"},{"@pid":"s/ChristophSprenger","text":"Christoph Sprenger 0001"}]},"title":"Consensus Refined.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/MaricS15","ee":"https://www.isa-afp.org/entries/Consensus_Refined.shtml","url":"https://dblp.org/rec/journals/afp/MaricS15"},
"url":"URL#2518877"
},
{
"@score":"1",
"@id":"2518878",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Parameterized Dynamic Tables.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow15","ee":"https://www.isa-afp.org/entries/Dynamic_Tables.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow15"},
"url":"URL#2518878"
},
{
"@score":"1",
"@id":"2518879",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"Reasoning about Lists via List Interleaving.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce15","ee":"https://www.isa-afp.org/entries/List_Interleaving.shtml","url":"https://dblp.org/rec/journals/afp/Noce15"},
"url":"URL#2518879"
},
{
"@score":"1",
"@id":"2518880",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"The Ipurge Unwinding Theorem for CSP Noninterference Security.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce15a","ee":"https://www.isa-afp.org/entries/Noninterference_Ipurge_Unwinding.shtml","url":"https://dblp.org/rec/journals/afp/Noce15a"},
"url":"URL#2518880"
},
{
"@score":"1",
"@id":"2518881",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"The Generic Unwinding Theorem for CSP Noninterference Security.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce15b","ee":"https://www.isa-afp.org/entries/Noninterference_Generic_Unwinding.shtml","url":"https://dblp.org/rec/journals/afp/Noce15b"},
"url":"URL#2518881"
},
{
"@score":"1",
"@id":"2518882",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"The Inductive Unwinding Theorem for CSP Noninterference Security.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce15c","ee":"https://www.isa-afp.org/entries/Noninterference_Inductive_Unwinding.shtml","url":"https://dblp.org/rec/journals/afp/Noce15c"},
"url":"URL#2518882"
},
{
"@score":"1",
"@id":"2518883",
"info":{"authors":{"author":{"@pid":"76/9959","text":"Lars Noschinski"}},"title":"Generating Cases from Labeled Subgoals.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Noschinski15","ee":"https://www.isa-afp.org/entries/Case_Labeling.shtml","url":"https://dblp.org/rec/journals/afp/Noschinski15"},
"url":"URL#2518883"
},
{
"@score":"1",
"@id":"2518884",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"Finite Automata in Hereditarily Finite Set Theory.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson15","ee":"https://www.isa-afp.org/entries/Finite_Automata_HF.shtml","url":"https://dblp.org/rec/journals/afp/Paulson15"},
"url":"URL#2518884"
},
{
"@score":"1",
"@id":"2518885",
"info":{"authors":{"author":[{"@pid":"27/4654","text":"Kirstin Peters"},{"@pid":"g/RobJvanGlabbeek","text":"Rob J. van Glabbeek"}]},"title":"Analysing and Comparing Encodability Criteria for Process Calculi.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/PetersG15","ee":"https://www.isa-afp.org/entries/Encodability_Process_Calculi.shtml","url":"https://dblp.org/rec/journals/afp/PetersG15"},
"url":"URL#2518885"
},
{
"@score":"1",
"@id":"2518886",
"info":{"authors":{"author":{"@pid":"129/1369","text":"Salomon Sickert"}},"title":"Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Sickert15","ee":"https://www.isa-afp.org/entries/LTL_to_DRA.shtml","url":"https://dblp.org/rec/journals/afp/Sickert15"},
"url":"URL#2518886"
},
{
"@score":"1",
"@id":"2518887",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Deriving class instances for datatypes.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT15","ee":"https://www.isa-afp.org/entries/Deriving.shtml","url":"https://dblp.org/rec/journals/afp/SternagelT15"},
"url":"URL#2518887"
},
{
"@score":"1",
"@id":"2518888",
"info":{"authors":{"author":{"@pid":"166/9623","text":"Jeremy Sylvestre"}},"title":"Representations of Finite Groups.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Sylvestre15","ee":"https://www.isa-afp.org/entries/Rep_Fin_Groups.shtml","url":"https://dblp.org/rec/journals/afp/Sylvestre15"},
"url":"URL#2518888"
},
{
"@score":"1",
"@id":"2518889",
"info":{"authors":{"author":[{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"Algebraic Numbers in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann015","ee":"https://www.isa-afp.org/entries/Algebraic_Numbers.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann015"},
"url":"URL#2518889"
},
{
"@score":"1",
"@id":"2518890",
"info":{"authors":{"author":[{"@pid":"89/2718","text":"René Thiemann"},{"@pid":"36/2450-2","text":"Akihisa Yamada 0002"}]},"title":"Matrices, Jordan Normal Forms, and Spectral Radius Theory.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/ThiemannY15","ee":"https://www.isa-afp.org/entries/Jordan_Normal_Form.shtml","url":"https://dblp.org/rec/journals/afp/ThiemannY15"},
"url":"URL#2518890"
},
{
"@score":"1",
"@id":"2518891",
"info":{"authors":{"author":{"@pid":"95/10567","text":"Dmitriy Traytel"}},"title":"Derivatives of Logical Formulas.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/Traytel15","ee":"https://www.isa-afp.org/entries/Formula_Derivatives.shtml","url":"https://dblp.org/rec/journals/afp/Traytel15"},
"url":"URL#2518891"
},
{
"@score":"1",
"@id":"2518892",
"info":{"authors":{"author":[{"@pid":"81/10475","text":"Frédéric Tuong"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"A Meta-Model for the Isabelle API.","venue":"Arch. Formal Proofs","volume":"2015","year":"2015","type":"Data and Artifacts","access":"open","key":"journals/afp/TuongW15","ee":"https://www.isa-afp.org/entries/Isabelle_Meta_Model.shtml","url":"https://dblp.org/rec/journals/afp/TuongW15"},
"url":"URL#2518892"
},
{
"@score":"1",
"@id":"2809497",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"21/8611","text":"Johannes Hölzl"}]},"title":"Probabilistic Noninterference.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/0001H14","ee":"https://www.isa-afp.org/entries/Probabilistic_Noninterference.shtml","url":"https://dblp.org/rec/journals/afp/0001H14"},
"url":"URL#2809497"
},
{
"@score":"1",
"@id":"2809498",
"info":{"authors":{"author":[{"@pid":"137/9587","text":"Stephan Adelsberger"},{"@pid":"94/3546","text":"Stefan Hetzl"},{"@pid":"151/3774","text":"Florian Pollak"}]},"title":"The Cayley-Hamilton Theorem.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/AdelsbergerHP14","ee":"https://www.isa-afp.org/entries/Cayley_Hamilton.shtml","url":"https://dblp.org/rec/journals/afp/AdelsbergerHP14"},
"url":"URL#2809498"
},
{
"@score":"1",
"@id":"2809499",
"info":{"authors":{"author":[{"@pid":"85/10670","text":"Alasdair Armstrong"},{"@pid":"139/0605","text":"Victor B. F. Gomes"},{"@pid":"57/4783","text":"Georg Struth"}]},"title":"Kleene Algebra with Tests and Demonic Refinement Algebras.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/ArmstrongGS14","ee":"https://www.isa-afp.org/entries/KAT_and_DRA.shtml","url":"https://dblp.org/rec/journals/afp/ArmstrongGS14"},
"url":"URL#2809499"
},
{
"@score":"1",
"@id":"2809500",
"info":{"authors":{"author":[{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Abstract Completeness.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Blanchette0T14","ee":"https://www.isa-afp.org/entries/Abstract_Completeness.shtml","url":"https://dblp.org/rec/journals/afp/Blanchette0T14"},
"url":"URL#2809500"
},
{
"@score":"1",
"@id":"2809501",
"info":{"authors":{"author":{"@pid":"72/6450","text":"Timothy Bourke"}},"title":"Mechanization of the Algebra for Wireless Networks (AWN).","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Bourke14","ee":"https://www.isa-afp.org/entries/AWN.shtml","url":"https://dblp.org/rec/journals/afp/Bourke14"},
"url":"URL#2809501"
},
{
"@score":"1",
"@id":"2809502",
"info":{"authors":{"author":[{"@pid":"72/6450","text":"Timothy Bourke"},{"@pid":"98/7040","text":"Peter Höfner"}]},"title":"Loop freedom of the (untimed) AODV routing protocol.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/BourkeH14","ee":"https://www.isa-afp.org/entries/AODV.shtml","url":"https://dblp.org/rec/journals/afp/BourkeH14"},
"url":"URL#2809502"
},
{
"@score":"1",
"@id":"2809503",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"77/372","text":"Lukas Brügger"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"The Unified Policy Framework (UPF).","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerBW14","ee":"https://www.isa-afp.org/entries/UPF.shtml","url":"https://dblp.org/rec/journals/afp/BruckerBW14"},
"url":"URL#2809503"
},
{
"@score":"1",
"@id":"2809504",
"info":{"authors":{"author":[{"@pid":"b/AchimDBrucker","text":"Achim D. Brucker"},{"@pid":"81/10475","text":"Frédéric Tuong"},{"@pid":"63/5369","text":"Burkhart Wolff"}]},"title":"Featherweight OCL - A Proposal for a Machine-Checked Formal Semantics for OCL 2.5.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/BruckerTW14","ee":"https://www.isa-afp.org/entries/Featherweight_OCL.shtml","url":"https://dblp.org/rec/journals/afp/BruckerTW14"},
"url":"URL#2809504"
},
{
"@score":"1",
"@id":"2809505",
"info":{"authors":{"author":{"@pid":"76/5940","text":"David Cock"}},"title":"pGCL for Isabelle.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Cock14","ee":"https://www.isa-afp.org/entries/pGCL.shtml","url":"https://dblp.org/rec/journals/afp/Cock14"},
"url":"URL#2809505"
},
{
"@score":"1",
"@id":"2809506",
"info":{"authors":{"author":{"@pid":"56/3094","text":"Alessandro Coglio"}},"title":"Pop-Refinement.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Coglio14","ee":"https://www.isa-afp.org/entries/Pop_Refinement.shtml","url":"https://dblp.org/rec/journals/afp/Coglio14"},
"url":"URL#2809506"
},
{
"@score":"1",
"@id":"2809507",
"info":{"authors":{"author":{"@pid":"140/7089","text":"Cornelius Diekmann"}},"title":"Network Security Policy Verification.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Diekmann14","ee":"https://www.isa-afp.org/entries/Network_Security_Policy_Verification.shtml","url":"https://dblp.org/rec/journals/afp/Diekmann14"},
"url":"URL#2809507"
},
{
"@score":"1",
"@id":"2809508",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"78/7015","text":"Jesús Aransay"}]},"title":"Gauss-Jordan Algorithm and Its Applications.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonA14","ee":"https://www.isa-afp.org/entries/Gauss_Jordan.shtml","url":"https://dblp.org/rec/journals/afp/DivasonA14"},
"url":"URL#2809508"
},
{
"@score":"1",
"@id":"2809509",
"info":{"authors":{"author":{"@pid":"139/6835","text":"Manuel Eberl"}},"title":"Sturm's Theorem.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Eberl14","ee":"https://www.isa-afp.org/entries/Sturm_Sequences.shtml","url":"https://dblp.org/rec/journals/afp/Eberl14"},
"url":"URL#2809509"
},
{
"@score":"1",
"@id":"2809510",
"info":{"authors":{"author":[{"@pid":"139/6835","text":"Manuel Eberl"},{"@pid":"21/8611","text":"Johannes Hölzl"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"A Verified Compiler for Probability Density Functions.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/EberlHN14","ee":"https://www.isa-afp.org/entries/Density_Compiler.shtml","url":"https://dblp.org/rec/journals/afp/EberlHN14"},
"url":"URL#2809510"
},
{
"@score":"1",
"@id":"2809511",
"info":{"authors":{"author":[{"@pid":"e/JEsparza","text":"Javier Esparza"},{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"88/11065","text":"René Neumann"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"},{"@pid":"51/7270","text":"Alexander Schimpf"},{"@pid":"s/JanGeorgSmaus","text":"Jan-Georg Smaus"}]},"title":"A Fully Verified Executable LTL Model Checker.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/EsparzaLNNSS14","ee":"https://www.isa-afp.org/entries/CAVA_LTL_Modelchecker.shtml","url":"https://dblp.org/rec/journals/afp/EsparzaLNNSS14"},
"url":"URL#2809511"
},
{
"@score":"1",
"@id":"2809512",
"info":{"authors":{"author":[{"@pid":"14/4971","text":"Simon Foster 0001"},{"@pid":"57/4783","text":"Georg Struth"}]},"title":"Regular Algebras.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/FosterS14","ee":"https://www.isa-afp.org/entries/Regular_Algebras.shtml","url":"https://dblp.org/rec/journals/afp/FosterS14"},
"url":"URL#2809512"
},
{
"@score":"1",
"@id":"2809513",
"info":{"authors":{"author":[{"@pid":"144/8769","text":"Sylvia Grewe"},{"@pid":"51/4977","text":"Alexander Lux"},{"@pid":"m/HeikoMantel","text":"Heiko Mantel"},{"@pid":"143/4155","text":"Jens Sauer"}]},"title":"A Formalization of Declassification with WHAT-and-WHERE-Security.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/GreweLMS14","ee":"https://www.isa-afp.org/entries/WHATandWHERE_Security.shtml","url":"https://dblp.org/rec/journals/afp/GreweLMS14"},
"url":"URL#2809513"
},
{
"@score":"1",
"@id":"2809514",
"info":{"authors":{"author":[{"@pid":"144/8769","text":"Sylvia Grewe"},{"@pid":"51/4977","text":"Alexander Lux"},{"@pid":"m/HeikoMantel","text":"Heiko Mantel"},{"@pid":"143/4155","text":"Jens Sauer"}]},"title":"A Formalization of Strong Security.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/GreweLMS14a","ee":"https://www.isa-afp.org/entries/Strong_Security.shtml","url":"https://dblp.org/rec/journals/afp/GreweLMS14a"},
"url":"URL#2809514"
},
{
"@score":"1",
"@id":"2809515",
"info":{"authors":{"author":[{"@pid":"144/8769","text":"Sylvia Grewe"},{"@pid":"m/HeikoMantel","text":"Heiko Mantel"},{"@pid":"144/8720","text":"Daniel Schoepe"}]},"title":"A Formalization of Assumptions and Guarantees for Compositional Noninterference.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/GreweMS14","ee":"https://www.isa-afp.org/entries/SIFUM_Type_Systems.shtml","url":"https://dblp.org/rec/journals/afp/GreweMS14"},
"url":"URL#2809515"
},
{
"@score":"1",
"@id":"2809516",
"info":{"authors":{"author":{"@pid":"46/6613","text":"Florian Haftmann"}},"title":"Discrete Summation.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Haftmann14","ee":"https://www.isa-afp.org/entries/Discrete_Summation.shtml","url":"https://dblp.org/rec/journals/afp/Haftmann14"},
"url":"URL#2809516"
},
{
"@score":"1",
"@id":"2809517",
"info":{"authors":{"author":{"@pid":"143/3168","text":"Lars Hupel"}},"title":"Properties of Random Graphs - Subgraph Containment.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Hupel14","ee":"https://www.isa-afp.org/entries/Random_Graph_Subgraph_Threshold.shtml","url":"https://dblp.org/rec/journals/afp/Hupel14"},
"url":"URL#2809517"
},
{
"@score":"1",
"@id":"2809518",
"info":{"authors":{"author":{"@pid":"47/11065","text":"Fabian Immler"}},"title":"Affine Arithmetic.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Immler14","ee":"https://www.isa-afp.org/entries/Affine_Arithmetic.shtml","url":"https://dblp.org/rec/journals/afp/Immler14"},
"url":"URL#2809518"
},
{
"@score":"1",
"@id":"2809519",
"info":{"authors":{"author":{"@pid":"49/5258","text":"Peter Lammich"}},"title":"Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Lammich14","ee":"https://www.isa-afp.org/entries/Gabow_SCC.shtml","url":"https://dblp.org/rec/journals/afp/Lammich14"},
"url":"URL#2809519"
},
{
"@score":"1",
"@id":"2809520",
"info":{"authors":{"author":{"@pid":"49/5258","text":"Peter Lammich"}},"title":"The CAVA Automata Library.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Lammich14a","ee":"https://www.isa-afp.org/entries/CAVA_Automata.shtml","url":"https://dblp.org/rec/journals/afp/Lammich14a"},
"url":"URL#2809520"
},
{
"@score":"1",
"@id":"2809521",
"info":{"authors":{"author":{"@pid":"150/3407","text":"Holden Lee"}},"title":"Vector Spaces.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Lee14","ee":"https://www.isa-afp.org/entries/VectorSpace.shtml","url":"https://dblp.org/rec/journals/afp/Lee14"},
"url":"URL#2809521"
},
{
"@score":"1",
"@id":"2809522",
"info":{"authors":{"author":{"@pid":"132/9868","text":"Wenda Li"}},"title":"The Sturm-Tarski Theorem.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Li14","ee":"https://www.isa-afp.org/entries/Sturm_Tarski.shtml","url":"https://dblp.org/rec/journals/afp/Li14"},
"url":"URL#2809522"
},
{
"@score":"1",
"@id":"2809523",
"info":{"authors":{"author":[{"@pid":"43/1499","text":"Andreas Lochbihler"},{"@pid":"152/7660","text":"Alexandra Maximova"}]},"title":"Stream Fusion in HOL with Code Generation.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/LochbihlerM14","ee":"https://www.isa-afp.org/entries/Stream_Fusion_Code.shtml","url":"https://dblp.org/rec/journals/afp/LochbihlerM14"},
"url":"URL#2809523"
},
{
"@score":"1",
"@id":"2809524",
"info":{"authors":{"author":{"@pid":"88/11065","text":"René Neumann"}},"title":"Promela Formalization.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Neumann14","ee":"https://www.isa-afp.org/entries/Promela.shtml","url":"https://dblp.org/rec/journals/afp/Neumann14"},
"url":"URL#2809524"
},
{
"@score":"1",
"@id":"2809525",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Boolean Expression Checkers.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow14","ee":"https://www.isa-afp.org/entries/Boolean_Expression_Checkers.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow14"},
"url":"URL#2809525"
},
{
"@score":"1",
"@id":"2809526",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Amortized Complexity Verified.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow14a","ee":"https://www.isa-afp.org/entries/Amortized_Complexity.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow14a"},
"url":"URL#2809526"
},
{
"@score":"1",
"@id":"2809527",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Splay Tree.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow14b","ee":"https://www.isa-afp.org/entries/Splay_Tree.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow14b"},
"url":"URL#2809527"
},
{
"@score":"1",
"@id":"2809528",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Skew Heap.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow14c","ee":"https://www.isa-afp.org/entries/Skew_Heap.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow14c"},
"url":"URL#2809528"
},
{
"@score":"1",
"@id":"2809529",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Priority Queues Based on Braun Trees.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow14d","ee":"https://www.isa-afp.org/entries/Priority_Queue_Braun.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow14d"},
"url":"URL#2809529"
},
{
"@score":"1",
"@id":"2809530",
"info":{"authors":{"author":[{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"},{"@pid":"95/10567","text":"Dmitriy Traytel"}]},"title":"Unified Decision Procedures for Regular Expression Equivalence.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/NipkowT14","ee":"https://www.isa-afp.org/entries/Regex_Equivalence.shtml","url":"https://dblp.org/rec/journals/afp/NipkowT14"},
"url":"URL#2809530"
},
{
"@score":"1",
"@id":"2809531",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"Noninterference Security in Communicating Sequential Processes.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce14","ee":"https://www.isa-afp.org/entries/Noninterference_CSP.shtml","url":"https://dblp.org/rec/journals/afp/Noce14"},
"url":"URL#2809531"
},
{
"@score":"1",
"@id":"2809532",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"Real-Valued Special Functions - Upper and Lower Bounds.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson14","ee":"https://www.isa-afp.org/entries/Special_Function_Bounds.shtml","url":"https://dblp.org/rec/journals/afp/Paulson14"},
"url":"URL#2809532"
},
{
"@score":"1",
"@id":"2809533",
"info":{"authors":{"author":{"@pid":"94/10965","text":"Danijela Petrovic"}},"title":"Verification of Selection and Heap Sort Using Locales.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Petrovic14","ee":"https://www.isa-afp.org/entries/Selection_Heap_Sort.shtml","url":"https://dblp.org/rec/journals/afp/Petrovic14"},
"url":"URL#2809533"
},
{
"@score":"1",
"@id":"2809534",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"Bounded-Deducibility Security.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuL14","ee":"https://www.isa-afp.org/entries/Bounded_Deducibility_Security.shtml","url":"https://dblp.org/rec/journals/afp/PopescuL14"},
"url":"URL#2809534"
},
{
"@score":"1",
"@id":"2809535",
"info":{"authors":{"author":{"@pid":"p/ViorelPreoteasa","text":"Viorel Preoteasa"}},"title":"Formalization of Refinement Calculus for Reactive Systems.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Preoteasa14","ee":"https://www.isa-afp.org/entries/RefinementReactive.shtml","url":"https://dblp.org/rec/journals/afp/Preoteasa14"},
"url":"URL#2809535"
},
{
"@score":"1",
"@id":"2809536",
"info":{"authors":{"author":[{"@pid":"88/1112-2","text":"Markus N. Rabe"},{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"}]},"title":"A shallow embedding of HyperCTL.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/RabeLP14","ee":"https://www.isa-afp.org/entries/HyperCTL.shtml","url":"https://dblp.org/rec/journals/afp/RabeLP14"},
"url":"URL#2809536"
},
{
"@score":"1",
"@id":"2809537",
"info":{"authors":{"author":{"@pid":"141/0729","text":"Jakob von Raumer"}},"title":"Secondary Sylow Theorems.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Raumer14","ee":"https://www.isa-afp.org/entries/Secondary_Sylow.shtml","url":"https://dblp.org/rec/journals/afp/Raumer14"},
"url":"URL#2809537"
},
{
"@score":"1",
"@id":"2809538",
"info":{"authors":{"author":{"@pid":"141/0729","text":"Jakob von Raumer"}},"title":"The Jordan-Hölder Theorem.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Raumer14a","ee":"https://www.isa-afp.org/entries/Jordan_Hoelder.shtml","url":"https://dblp.org/rec/journals/afp/Raumer14a"},
"url":"URL#2809538"
},
{
"@score":"1",
"@id":"2809539",
"info":{"authors":{"author":[{"@pid":"51/7270","text":"Alexander Schimpf"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"Converting Linear-Time Temporal Logic to Generalized Büchi Automata.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/SchimpfL14","ee":"https://www.isa-afp.org/entries/LTL_to_GBA.shtml","url":"https://dblp.org/rec/journals/afp/SchimpfL14"},
"url":"URL#2809539"
},
{
"@score":"1",
"@id":"2809540",
"info":{"authors":{"author":{"@pid":"65/3176","text":"Maria Spichkova"}},"title":"Compositional Properties of Crypto-Based Components.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Spichkova14","ee":"https://www.isa-afp.org/entries/CryptoBasedCompositionalProperties.shtml","url":"https://dblp.org/rec/journals/afp/Spichkova14"},
"url":"URL#2809540"
},
{
"@score":"1",
"@id":"2809541",
"info":{"authors":{"author":{"@pid":"65/3176","text":"Maria Spichkova"}},"title":"Formalisation and Analysis of Component Dependencies.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Spichkova14a","ee":"https://www.isa-afp.org/entries/ComponentDependencies.shtml","url":"https://dblp.org/rec/journals/afp/Spichkova14a"},
"url":"URL#2809541"
},
{
"@score":"1",
"@id":"2809542",
"info":{"authors":{"author":{"@pid":"33/287","text":"Christian Sternagel"}},"title":"Imperative Insertion Sort.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Sternagel14","ee":"https://www.isa-afp.org/entries/Imperative_Insertion_Sort.shtml","url":"https://dblp.org/rec/journals/afp/Sternagel14"},
"url":"URL#2809542"
},
{
"@score":"1",
"@id":"2809543",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Haskell's Show-Class in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT14","ee":"https://www.isa-afp.org/entries/Show.shtml","url":"https://dblp.org/rec/journals/afp/SternagelT14"},
"url":"URL#2809543"
},
{
"@score":"1",
"@id":"2809544",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"XML.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT14a","ee":"https://www.isa-afp.org/entries/XML.shtml","url":"https://dblp.org/rec/journals/afp/SternagelT14a"},
"url":"URL#2809544"
},
{
"@score":"1",
"@id":"2809545",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Certification Monads.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT14b","ee":"https://www.isa-afp.org/entries/Certification_Monads.shtml","url":"https://dblp.org/rec/journals/afp/SternagelT14b"},
"url":"URL#2809545"
},
{
"@score":"1",
"@id":"2809546",
"info":{"authors":{"author":[{"@pid":"57/4783","text":"Georg Struth"},{"@pid":"56/3934","text":"Tjark Weber"}]},"title":"Relation Algebra.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/StruthW14","ee":"https://www.isa-afp.org/entries/Relation_Algebra.shtml","url":"https://dblp.org/rec/journals/afp/StruthW14"},
"url":"URL#2809546"
},
{
"@score":"1",
"@id":"2809547",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"Implementing field extensions of the form Q[sqrt(b)].","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann14","ee":"https://www.isa-afp.org/entries/Real_Impl.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann14"},
"url":"URL#2809547"
},
{
"@score":"1",
"@id":"2809548",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"Mutually Recursive Partial Functions.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann14a","ee":"https://www.isa-afp.org/entries/Partial_Function_MR.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann14a"},
"url":"URL#2809548"
},
{
"@score":"1",
"@id":"2809549",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"Lifting Definition Option.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann14b","ee":"https://www.isa-afp.org/entries/Lifting_Definition_Option.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann14b"},
"url":"URL#2809549"
},
{
"@score":"1",
"@id":"2809550",
"info":{"authors":{"author":[{"@pid":"95/10567","text":"Dmitriy Traytel"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/TraytelN14","ee":"https://www.isa-afp.org/entries/MSO_Regex_Equivalence.shtml","url":"https://dblp.org/rec/journals/afp/TraytelN14"},
"url":"URL#2809550"
},
{
"@score":"1",
"@id":"2809551",
"info":{"authors":{"author":[{"@pid":"01/8190","text":"Freek Verbeek"},{"@pid":"05/789","text":"Sergey Tverdyshev"},{"@pid":"64/8942","text":"Oto Havle"},{"@pid":"98/7270","text":"Holger Blasum"},{"@pid":"31/1827","text":"Bruno Langenstein"},{"@pid":"151/9339","text":"Werner Stephan 0001"},{"@pid":"130/7500","text":"Yakoub Nemouchi"},{"@pid":"38/8434","text":"Abderrahmane Feliachi"},{"@pid":"63/5369","text":"Burkhart Wolff"},{"@pid":"33/2094","text":"Julien Schmaltz"}]},"title":"Formal Specification of a Generic Separation Kernel.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/VerbeekTHBLSNFWS14","ee":"https://www.isa-afp.org/entries/CISC-Kernel.shtml","url":"https://dblp.org/rec/journals/afp/VerbeekTHBLSNFWS14"},
"url":"URL#2809551"
},
{
"@score":"1",
"@id":"2809552",
"info":{"authors":{"author":{"@pid":"w/MarkusWenzel","text":"Makarius Wenzel"}},"title":"Transitive closure according to Roy-Floyd-Warshall.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Wenzel14","ee":"https://www.isa-afp.org/entries/Roy_Floyd_Warshall.shtml","url":"https://dblp.org/rec/journals/afp/Wenzel14"},
"url":"URL#2809552"
},
{
"@score":"1",
"@id":"2809553",
"info":{"authors":{"author":{"@pid":"21/7915","text":"John Wickerson"}},"title":"Syntax and semantics of a GPU kernel programming language.","venue":"Arch. Formal Proofs","volume":"2014","year":"2014","type":"Data and Artifacts","access":"open","key":"journals/afp/Wickerson14","ee":"https://www.isa-afp.org/entries/GPU_Kernel_PL.shtml","url":"https://dblp.org/rec/journals/afp/Wickerson14"},
"url":"URL#2809553"
},
{
"@score":"1",
"@id":"3088210",
"info":{"authors":{"author":[{"@pid":"85/10670","text":"Alasdair Armstrong"},{"@pid":"57/4783","text":"Georg Struth"},{"@pid":"56/3934","text":"Tjark Weber"}]},"title":"Kleene Algebra.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/ArmstrongSW13","ee":"https://www.isa-afp.org/entries/Kleene_Algebra.shtml","url":"https://dblp.org/rec/journals/afp/ArmstrongSW13"},
"url":"URL#3088210"
},
{
"@score":"1",
"@id":"3088211",
"info":{"authors":{"author":[{"@pid":"b/CBenzmueller","text":"Christoph Benzmueller"},{"@pid":"64/228","text":"Bruno Woltzenlogel Paleo"}]},"title":"Gödel's God in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Benzmueller13","ee":"https://www.isa-afp.org/entries/GoedelGod.shtml","url":"https://dblp.org/rec/journals/afp/Benzmueller13"},
"url":"URL#3088211"
},
{
"@score":"1",
"@id":"3088212",
"info":{"authors":{"author":[{"@pid":"52/6913","text":"Jasmin Christian Blanchette"},{"@pid":"89/2346-1","text":"Andrei Popescu 0001"}]},"title":"Sound and Complete Sort Encodings for First-Order Logic.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Blanchette013","ee":"https://www.isa-afp.org/entries/Sort_Encodings.shtml","url":"https://dblp.org/rec/journals/afp/Blanchette013"},
"url":"URL#3088212"
},
{
"@score":"1",
"@id":"3088213",
"info":{"authors":{"author":{"@pid":"80/9827","text":"Joachim Breitner"}},"title":"The Correctness of Launchbury's Natural Semantics for Lazy Evaluation.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Breitner13","ee":"https://www.isa-afp.org/entries/Launchbury.shtml","url":"https://dblp.org/rec/journals/afp/Breitner13"},
"url":"URL#3088213"
},
{
"@score":"1",
"@id":"3088214",
"info":{"authors":{"author":[{"@pid":"124/7624","text":"Jose Divasón"},{"@pid":"78/7015","text":"Jesús Aransay"}]},"title":"Rank-Nullity Theorem in Linear Algebra.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/DivasonA13","ee":"https://www.isa-afp.org/entries/Rank_Nullity_Theorem.shtml","url":"https://dblp.org/rec/journals/afp/DivasonA13"},
"url":"URL#3088214"
},
{
"@score":"1",
"@id":"3088215",
"info":{"authors":{"author":{"@pid":"49/5258","text":"Peter Lammich"}},"title":"Automatic Data Refinement.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Lammich13","ee":"https://www.isa-afp.org/entries/Automatic_Refinement.shtml","url":"https://dblp.org/rec/journals/afp/Lammich13"},
"url":"URL#3088215"
},
{
"@score":"1",
"@id":"3088216",
"info":{"authors":{"author":{"@pid":"132/9868","text":"Wenda Li"}},"title":"The Königsberg Bridge Problem and the Friendship Theorem.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Li13","ee":"https://www.isa-afp.org/entries/Koenigsberg_Friendship.shtml","url":"https://dblp.org/rec/journals/afp/Li13"},
"url":"URL#3088216"
},
{
"@score":"1",
"@id":"3088217",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"Light-weight Containers.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler13","ee":"https://www.isa-afp.org/entries/Containers.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler13"},
"url":"URL#3088217"
},
{
"@score":"1",
"@id":"3088218",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"Native Word.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler13a","ee":"https://www.isa-afp.org/entries/Native_Word.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler13a"},
"url":"URL#3088218"
},
{
"@score":"1",
"@id":"3088219",
"info":{"authors":{"author":{"@pid":"139/1923","text":"Pasquale Noce"}},"title":"A General Method for the Proof of Theorems on Tail-recursive Functions.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Noce13","ee":"https://www.isa-afp.org/entries/Tail_Recursive_Functions.shtml","url":"https://dblp.org/rec/journals/afp/Noce13"},
"url":"URL#3088219"
},
{
"@score":"1",
"@id":"3088220",
"info":{"authors":{"author":{"@pid":"76/9959","text":"Lars Noschinski"}},"title":"Graph Theory.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Noschinski13","ee":"https://www.isa-afp.org/entries/Graph_Theory.shtml","url":"https://dblp.org/rec/journals/afp/Noschinski13"},
"url":"URL#3088220"
},
{
"@score":"1",
"@id":"3088221",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"Gödel's Incompleteness Theorems.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson13","ee":"https://www.isa-afp.org/entries/Incompleteness.shtml","url":"https://dblp.org/rec/journals/afp/Paulson13"},
"url":"URL#3088221"
},
{
"@score":"1",
"@id":"3088222",
"info":{"authors":{"author":{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}},"title":"The Hereditarily Finite Sets.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Paulson13a","ee":"https://www.isa-afp.org/entries/HereditarilyFinite.shtml","url":"https://dblp.org/rec/journals/afp/Paulson13a"},
"url":"URL#3088222"
},
{
"@score":"1",
"@id":"3088223",
"info":{"authors":{"author":{"@pid":"50/9861","text":"Christine Rizkallah"}},"title":"An Axiomatic Characterization of the Single-Source Shortest Path Problem.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Rizkallah13","ee":"https://www.isa-afp.org/entries/ShortestPath.shtml","url":"https://dblp.org/rec/journals/afp/Rizkallah13"},
"url":"URL#3088223"
},
{
"@score":"1",
"@id":"3088224",
"info":{"authors":{"author":{"@pid":"65/3176","text":"Maria Spichkova"}},"title":"Stream Processing Components - Isabelle/HOL Formalisation and Case Studies.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Spichkova13","ee":"https://www.isa-afp.org/entries/FocusStreamsCaseStudies.shtml","url":"https://dblp.org/rec/journals/afp/Spichkova13"},
"url":"URL#3088224"
},
{
"@score":"1",
"@id":"3088225",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"Computing Square Roots using the Babylonian Method.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann13","ee":"https://www.isa-afp.org/entries/Sqrt_Babylonian.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann13"},
"url":"URL#3088225"
},
{
"@score":"1",
"@id":"3088226",
"info":{"authors":{"author":{"@pid":"95/10567","text":"Dmitriy Traytel"}},"title":"A Codatatype of Formal Languages.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Traytel13","ee":"https://www.isa-afp.org/entries/Coinductive_Languages.shtml","url":"https://dblp.org/rec/journals/afp/Traytel13"},
"url":"URL#3088226"
},
{
"@score":"1",
"@id":"3088227",
"info":{"authors":{"author":{"@pid":"21/7915","text":"John Wickerson"}},"title":"Ribbon Proofs.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Wickerson13","ee":"https://www.isa-afp.org/entries/Ribbon_Proofs.shtml","url":"https://dblp.org/rec/journals/afp/Wickerson13"},
"url":"URL#3088227"
},
{
"@score":"1",
"@id":"3088228",
"info":{"authors":{"author":[{"@pid":"132/9797","text":"Simon Wimmer 0001"},{"@pid":"76/9959","text":"Lars Noschinski"}]},"title":"Pratt's Primality Certificates.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/WimmerN13","ee":"https://www.isa-afp.org/entries/Pratt_Certificate.shtml","url":"https://dblp.org/rec/journals/afp/WimmerN13"},
"url":"URL#3088228"
},
{
"@score":"1",
"@id":"3088229",
"info":{"authors":{"author":[{"@pid":"132/9797","text":"Simon Wimmer 0001"},{"@pid":"76/9959","text":"Lars Noschinski"}]},"title":"Lehmer's Theorem.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/WimmerN13a","ee":"https://www.isa-afp.org/entries/Lehmer.shtml","url":"https://dblp.org/rec/journals/afp/WimmerN13a"},
"url":"URL#3088229"
},
{
"@score":"1",
"@id":"3088230",
"info":{"authors":{"author":{"@pid":"01/2775","text":"Lei Yu"}},"title":"A Formal Model of IEEE Floating Point Arithmetic.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Yu13","ee":"https://www.isa-afp.org/entries/IEEE_Floating_Point.shtml","url":"https://dblp.org/rec/journals/afp/Yu13"},
"url":"URL#3088230"
},
{
"@score":"1",
"@id":"3088231",
"info":{"authors":{"author":{"@pid":"49/4488","text":"Harald Zankl"}},"title":"Decreasing Diagrams.","venue":"Arch. Formal Proofs","volume":"2013","year":"2013","type":"Data and Artifacts","access":"open","key":"journals/afp/Zankl13","ee":"https://www.isa-afp.org/entries/Decreasing-Diagrams.shtml","url":"https://dblp.org/rec/journals/afp/Zankl13"},
"url":"URL#3088231"
},
{
"@score":"1",
"@id":"3351387",
"info":{"authors":{"author":[{"@pid":"60/1535","text":"Jeremy Avigad"},{"@pid":"94/3546","text":"Stefan Hetzl"}]},"title":"Bondy's Theorem.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/AvigadH12","ee":"https://www.isa-afp.org/entries/Bondy.shtml","url":"https://dblp.org/rec/journals/afp/AvigadH12"},
"url":"URL#3351387"
},
{
"@score":"1",
"@id":"3351388",
"info":{"authors":{"author":{"@pid":"93/3317","text":"Giampaolo Bella"}},"title":"Inductive Study of Confidentiality.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Bella12","ee":"https://www.isa-afp.org/entries/Inductive_Confidentiality.shtml","url":"https://dblp.org/rec/journals/afp/Bella12"},
"url":"URL#3351388"
},
{
"@score":"1",
"@id":"3351389",
"info":{"authors":{"author":{"@pid":"65/1245","text":"Jesper Bengtson"}},"title":"Psi-calculi in Isabelle.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Bengtson12","ee":"https://www.isa-afp.org/entries/Psi_Calculi.shtml","url":"https://dblp.org/rec/journals/afp/Bengtson12"},
"url":"URL#3351389"
},
{
"@score":"1",
"@id":"3351390",
"info":{"authors":{"author":{"@pid":"65/1245","text":"Jesper Bengtson"}},"title":"The pi-calculus in nominal logic.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Bengtson12a","ee":"https://www.isa-afp.org/entries/Pi_Calculus.shtml","url":"https://dblp.org/rec/journals/afp/Bengtson12a"},
"url":"URL#3351390"
},
{
"@score":"1",
"@id":"3351391",
"info":{"authors":{"author":{"@pid":"65/1245","text":"Jesper Bengtson"}},"title":"CCS in nominal logic.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Bengtson12b","ee":"https://www.isa-afp.org/entries/CCS.shtml","url":"https://dblp.org/rec/journals/afp/Bengtson12b"},
"url":"URL#3351391"
},
{
"@score":"1",
"@id":"3351392",
"info":{"authors":{"author":[{"@pid":"02/10266","text":"Henri Debrat"},{"@pid":"52/4601","text":"Stephan Merz"}]},"title":"Verifying Fault-Tolerant Distributed Algorithms in the Heard-Of Model.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/DebratM12","ee":"https://www.isa-afp.org/entries/Heard_Of.shtml","url":"https://dblp.org/rec/journals/afp/DebratM12"},
"url":"URL#3351392"
},
{
"@score":"1",
"@id":"3351393",
"info":{"authors":{"author":[{"@pid":"38/8434","text":"Abderrahmane Feliachi"},{"@pid":"63/5369","text":"Burkhart Wolff"},{"@pid":"74/4866","text":"Marie-Claude Gaudel"}]},"title":"Isabelle/Circus.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/FeliachiWG12","ee":"https://www.isa-afp.org/entries/Circus.shtml","url":"https://dblp.org/rec/journals/afp/FeliachiWG12"},
"url":"URL#3351393"
},
{
"@score":"1",
"@id":"3351394",
"info":{"authors":{"author":{"@pid":"20/6956","text":"Peter Gammie"}},"title":"Logical Relations for PCF.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Gammie12","ee":"https://www.isa-afp.org/entries/PCF.shtml","url":"https://dblp.org/rec/journals/afp/Gammie12"},
"url":"URL#3351394"
},
{
"@score":"1",
"@id":"3351395",
"info":{"authors":{"author":[{"@pid":"g/RachidGuerraoui","text":"Rachid Guerraoui"},{"@pid":"k/ViktorKuncak","text":"Viktor Kuncak"},{"@pid":"04/11066","text":"Giuliano Losa"}]},"title":"Abortable Linearizable Modules.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/GuerraouiKL12","ee":"https://www.isa-afp.org/entries/Abortable_Linearizable_Modules.shtml","url":"https://dblp.org/rec/journals/afp/GuerraouiKL12"},
"url":"URL#3351395"
},
{
"@score":"1",
"@id":"3351396",
"info":{"authors":{"author":[{"@pid":"21/8611","text":"Johannes Hölzl"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Markov Models.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/HolzlN12","ee":"https://www.isa-afp.org/entries/Markov_Models.shtml","url":"https://dblp.org/rec/journals/afp/HolzlN12"},
"url":"URL#3351396"
},
{
"@score":"1",
"@id":"3351397",
"info":{"authors":{"author":{"@pid":"69/3465","text":"Brian Huffman"}},"title":"Type Constructor Classes and Monad Transformers.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Huffman12","ee":"https://www.isa-afp.org/entries/Tycon.shtml","url":"https://dblp.org/rec/journals/afp/Huffman12"},
"url":"URL#3351397"
},
{
"@score":"1",
"@id":"3351398",
"info":{"authors":{"author":[{"@pid":"47/11065","text":"Fabian Immler"},{"@pid":"21/8611","text":"Johannes Hölzl"}]},"title":"Ordinary Differential Equations.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/ImmlerH12","ee":"https://www.isa-afp.org/entries/Ordinary_Differential_Equations.shtml","url":"https://dblp.org/rec/journals/afp/ImmlerH12"},
"url":"URL#3351398"
},
{
"@score":"1",
"@id":"3351399",
"info":{"authors":{"author":[{"@pid":"74/2171","text":"Gerwin Klein"},{"@pid":"87/2179","text":"Rafal Kolanski"},{"@pid":"30/7538","text":"Andrew Boyton"}]},"title":"Separation Algebra.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/KleinKB12","ee":"https://www.isa-afp.org/entries/Separation_Algebra.shtml","url":"https://dblp.org/rec/journals/afp/KleinKB12"},
"url":"URL#3351399"
},
{
"@score":"1",
"@id":"3351400",
"info":{"authors":{"author":{"@pid":"49/5258","text":"Peter Lammich"}},"title":"Refinement for Monadic Programs.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Lammich12","ee":"https://www.isa-afp.org/entries/Refine_Monadic.shtml","url":"https://dblp.org/rec/journals/afp/Lammich12"},
"url":"URL#3351400"
},
{
"@score":"1",
"@id":"3351401",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"10/11066","text":"Rene Meis"}]},"title":"A Separation Logic Framework for Imperative HOL.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichM12","ee":"https://www.isa-afp.org/entries/Separation_Logic_Imperative_HOL.shtml","url":"https://dblp.org/rec/journals/afp/LammichM12"},
"url":"URL#3351401"
},
{
"@score":"1",
"@id":"3351402",
"info":{"authors":{"author":{"@pid":"123/6559","text":"T. J. M. Makarios"}},"title":"The independence of Tarski's Euclidean axiom.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Makarios12","ee":"https://www.isa-afp.org/entries/Tarskis_Geometry.shtml","url":"https://dblp.org/rec/journals/afp/Makarios12"},
"url":"URL#3351402"
},
{
"@score":"1",
"@id":"3351403",
"info":{"authors":{"author":{"@pid":"52/4601","text":"Stephan Merz"}},"title":"Stuttering Equivalence.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Merz12","ee":"https://www.isa-afp.org/entries/Stuttering_Equivalence.shtml","url":"https://dblp.org/rec/journals/afp/Merz12"},
"url":"URL#3351403"
},
{
"@score":"1",
"@id":"3351404",
"info":{"authors":{"author":[{"@pid":"52/11066","text":"Benedikt Nordhoff"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"Dijkstra's Shortest Path Algorithm.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/NordhoffL12","ee":"https://www.isa-afp.org/entries/Dijkstra_Shortest_Path.shtml","url":"https://dblp.org/rec/journals/afp/NordhoffL12"},
"url":"URL#3351404"
},
{
"@score":"1",
"@id":"3351405",
"info":{"authors":{"author":{"@pid":"76/9959","text":"Lars Noschinski"}},"title":"A Probabilistic Proof of the Girth-Chromatic Number Theorem.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Noschinski12","ee":"https://www.isa-afp.org/entries/Girth_Chromatic.shtml","url":"https://dblp.org/rec/journals/afp/Noschinski12"},
"url":"URL#3351405"
},
{
"@score":"1",
"@id":"3351406",
"info":{"authors":{"author":[{"@pid":"89/2346-1","text":"Andrei Popescu 0001"},{"@pid":"21/8611","text":"Johannes Hölzl"}]},"title":"Possibilistic Noninterference.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/PopescuH12","ee":"https://www.isa-afp.org/entries/Possibilistic_Noninterference.shtml","url":"https://dblp.org/rec/journals/afp/PopescuH12"},
"url":"URL#3351406"
},
{
"@score":"1",
"@id":"3351407",
"info":{"authors":{"author":[{"@pid":"123/6882","text":"Ralph Romanos"},{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}]},"title":"Proving the Impossibility of Trisecting an Angle and Doubling the Cube.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/RomanosP12","ee":"https://www.isa-afp.org/entries/Impossible_Geometry.shtml","url":"https://dblp.org/rec/journals/afp/RomanosP12"},
"url":"URL#3351407"
},
{
"@score":"1",
"@id":"3351408",
"info":{"authors":{"author":{"@pid":"33/287","text":"Christian Sternagel"}},"title":"Well-Quasi-Orders.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Sternagel12","ee":"https://www.isa-afp.org/entries/Well_Quasi_Orders.shtml","url":"https://dblp.org/rec/journals/afp/Sternagel12"},
"url":"URL#3351408"
},
{
"@score":"1",
"@id":"3351409",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"Executable Transitive Closures.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann12","ee":"https://www.isa-afp.org/entries/Transitive-Closure-II.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann12"},
"url":"URL#3351409"
},
{
"@score":"1",
"@id":"3351410",
"info":{"authors":{"author":{"@pid":"89/2718","text":"René Thiemann"}},"title":"Generating linear orders for datatypes.","venue":"Arch. Formal Proofs","volume":"2012","year":"2012","type":"Data and Artifacts","access":"open","key":"journals/afp/Thiemann12a","ee":"https://www.isa-afp.org/entries/Datatype_Order_Generator.shtml","url":"https://dblp.org/rec/journals/afp/Thiemann12a"},
"url":"URL#3351410"
},
{
"@score":"1",
"@id":"3601808",
"info":{"authors":{"author":{"@pid":"80/9827","text":"Joachim Breitner"}},"title":"The General Triangle Is Unique.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Breitner11","ee":"https://www.isa-afp.org/entries/General-Triangle.shtml","url":"https://dblp.org/rec/journals/afp/Breitner11"},
"url":"URL#3601808"
},
{
"@score":"1",
"@id":"3601809",
"info":{"authors":{"author":{"@pid":"20/6956","text":"Peter Gammie"}},"title":"Knowledge-based programs.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Gammie11","ee":"https://www.isa-afp.org/entries/KBPs.shtml","url":"https://dblp.org/rec/journals/afp/Gammie11"},
"url":"URL#3601809"
},
{
"@score":"1",
"@id":"3601810",
"info":{"authors":{"author":[{"@pid":"28/3008","text":"George Georgescu"},{"@pid":"41/200","text":"Laurentiu Leustean"},{"@pid":"p/ViorelPreoteasa","text":"Viorel Preoteasa"}]},"title":"Pseudo Hoops.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/GeorgescuLP11","ee":"https://www.isa-afp.org/entries/PseudoHoops.shtml","url":"https://dblp.org/rec/journals/afp/GeorgescuLP11"},
"url":"URL#3601810"
},
{
"@score":"1",
"@id":"3601811",
"info":{"authors":{"author":{"@pid":"52/7260","text":"Bogdan Grechuk"}},"title":"Lower Semicontinuous Functions.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Grechuk11","ee":"https://www.isa-afp.org/entries/Lower_Semicontinuous.shtml","url":"https://dblp.org/rec/journals/afp/Grechuk11"},
"url":"URL#3601811"
},
{
"@score":"1",
"@id":"3601812",
"info":{"authors":{"author":[{"@pid":"43/4457","text":"Gudmund Grov"},{"@pid":"52/4601","text":"Stephan Merz"}]},"title":"A Definitional Encoding of TLA* in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/GrovM11","ee":"https://www.isa-afp.org/entries/TLA.shtml","url":"https://dblp.org/rec/journals/afp/GrovM11"},
"url":"URL#3601812"
},
{
"@score":"1",
"@id":"3601813",
"info":{"authors":{"author":{"@pid":"47/11065","text":"Fabian Immler"}},"title":"RIPEMD-160.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Immler11","ee":"https://www.isa-afp.org/entries/RIPEMD-160-SPARK.shtml","url":"https://dblp.org/rec/journals/afp/Immler11"},
"url":"URL#3601813"
},
{
"@score":"1",
"@id":"3601814",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Gauss-Jordan Elimination for Matrices Represented as Functions.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow11","ee":"https://www.isa-afp.org/entries/Gauss-Jordan-Elim-Fun.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow11"},
"url":"URL#3601814"
},
{
"@score":"1",
"@id":"3601815",
"info":{"authors":{"author":{"@pid":"p/ViorelPreoteasa","text":"Viorel Preoteasa"}},"title":"Lattice Properties.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Preoteasa11","ee":"https://www.isa-afp.org/entries/LatticeProperties.shtml","url":"https://dblp.org/rec/journals/afp/Preoteasa11"},
"url":"URL#3601815"
},
{
"@score":"1",
"@id":"3601816",
"info":{"authors":{"author":{"@pid":"p/ViorelPreoteasa","text":"Viorel Preoteasa"}},"title":"Algebra of Monotonic Boolean Transformers.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Preoteasa11a","ee":"https://www.isa-afp.org/entries/MonoBoolTranAlgebra.shtml","url":"https://dblp.org/rec/journals/afp/Preoteasa11a"},
"url":"URL#3601816"
},
{
"@score":"1",
"@id":"3601817",
"info":{"authors":{"author":{"@pid":"50/9861","text":"Christine Rizkallah"}},"title":"Maximum Cardinality Matching.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Rizkallah11","ee":"https://www.isa-afp.org/entries/Max-Card-Matching.shtml","url":"https://dblp.org/rec/journals/afp/Rizkallah11"},
"url":"URL#3601817"
},
{
"@score":"1",
"@id":"3601818",
"info":{"authors":{"author":{"@pid":"33/287","text":"Christian Sternagel"}},"title":"Efficient Mergesort.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Sternagel11","ee":"https://www.isa-afp.org/entries/Efficient-Mergesort.shtml","url":"https://dblp.org/rec/journals/afp/Sternagel11"},
"url":"URL#3601818"
},
{
"@score":"1",
"@id":"3601819",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Executable Transitive Closures of Finite Relations.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT11","ee":"https://www.isa-afp.org/entries/Transitive-Closure.shtml","url":"https://dblp.org/rec/journals/afp/SternagelT11"},
"url":"URL#3601819"
},
{
"@score":"1",
"@id":"3601820",
"info":{"authors":{"author":[{"@pid":"s/RokStrnisa","text":"Rok Strnisa"},{"@pid":"19/5443","text":"Matthew J. Parkinson"}]},"title":"Lightweight Java.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/StrnisaP11","ee":"https://www.isa-afp.org/entries/LightweightJava.shtml","url":"https://dblp.org/rec/journals/afp/StrnisaP11"},
"url":"URL#3601820"
},
{
"@score":"1",
"@id":"3601821",
"info":{"authors":{"author":{"@pid":"81/1805","text":"David Trachtenherz"}},"title":"Interval Temporal Logic on Natural Numbers.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Trachtenherz11","ee":"https://www.isa-afp.org/entries/Nat-Interval-Logic.shtml","url":"https://dblp.org/rec/journals/afp/Trachtenherz11"},
"url":"URL#3601821"
},
{
"@score":"1",
"@id":"3601822",
"info":{"authors":{"author":{"@pid":"81/1805","text":"David Trachtenherz"}},"title":"AutoFocus Stream Processing for Single-Clocking and Multi-Clocking Semantics.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Trachtenherz11a","ee":"https://www.isa-afp.org/entries/AutoFocus-Stream.shtml","url":"https://dblp.org/rec/journals/afp/Trachtenherz11a"},
"url":"URL#3601822"
},
{
"@score":"1",
"@id":"3601823",
"info":{"authors":{"author":{"@pid":"81/1805","text":"David Trachtenherz"}},"title":"Infinite Lists.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/Trachtenherz11b","ee":"https://www.isa-afp.org/entries/List-Infinite.shtml","url":"https://dblp.org/rec/journals/afp/Trachtenherz11b"},
"url":"URL#3601823"
},
{
"@score":"1",
"@id":"3601824",
"info":{"authors":{"author":[{"@pid":"88/225","text":"Chunhan Wu"},{"@pid":"66/3825","text":"Xingyuan Zhang"},{"@pid":"u/ChristianUrban","text":"Christian Urban"}]},"title":"The Myhill-Nerode Theorem Based on Regular Expressions.","venue":"Arch. Formal Proofs","volume":"2011","year":"2011","type":"Data and Artifacts","access":"open","key":"journals/afp/WuZU11","ee":"https://www.isa-afp.org/entries/Myhill-Nerode.shtml","url":"https://dblp.org/rec/journals/afp/WuZU11"},
"url":"URL#3601824"
},
{
"@score":"1",
"@id":"3829053",
"info":{"authors":{"author":{"@pid":"80/9827","text":"Joachim Breitner"}},"title":"Free Groups.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Breitner10","ee":"https://www.isa-afp.org/entries/Free-Groups.shtml","url":"https://dblp.org/rec/journals/afp/Breitner10"},
"url":"URL#3829053"
},
{
"@score":"1",
"@id":"3829054",
"info":{"authors":{"author":{"@pid":"80/9827","text":"Joachim Breitner"}},"title":"Shivers' Control Flow Analysis.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Breitner10a","ee":"https://www.isa-afp.org/entries/Shivers-CFA.shtml","url":"https://dblp.org/rec/journals/afp/Breitner10a"},
"url":"URL#3829054"
},
{
"@score":"1",
"@id":"3829055",
"info":{"authors":{"author":{"@pid":"22/10475","text":"Christian Doczkal"}},"title":"Strong Normalization of Moggis's Computational Metalanguage.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Doczkal10","ee":"https://www.isa-afp.org/entries/Lam-ml-Normalization.shtml","url":"https://dblp.org/rec/journals/afp/Doczkal10"},
"url":"URL#3829055"
},
{
"@score":"1",
"@id":"3829056",
"info":{"authors":{"author":[{"@pid":"47/5227","text":"Steffen Helke"},{"@pid":"47/6815","text":"Florian Kammüller"}]},"title":"Formalizing Statecharts using Hierarchical Automata.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/HelkeK10","ee":"https://www.isa-afp.org/entries/Statecharts.shtml","url":"https://dblp.org/rec/journals/afp/HelkeK10"},
"url":"URL#3829056"
},
{
"@score":"1",
"@id":"3829057",
"info":{"authors":{"author":[{"@pid":"15/145","text":"Ludovic Henrio"},{"@pid":"47/6815","text":"Florian Kammüller"},{"@pid":"09/11066","text":"Bianca Lutz"},{"@pid":"96/6080","text":"Henry Sudhof"}]},"title":"Locally Nameless Sigma Calculus.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/HenrioKLS10","ee":"https://www.isa-afp.org/entries/Locally-Nameless-Sigma.shtml","url":"https://dblp.org/rec/journals/afp/HenrioKLS10"},
"url":"URL#3829057"
},
{
"@score":"1",
"@id":"3829058",
"info":{"authors":{"author":{"@pid":"69/3465","text":"Brian Huffman"}},"title":"Free Boolean Algebra.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Huffman10","ee":"https://www.isa-afp.org/entries/Free-Boolean-Algebra.shtml","url":"https://dblp.org/rec/journals/afp/Huffman10"},
"url":"URL#3829058"
},
{
"@score":"1",
"@id":"3829059",
"info":{"authors":{"author":[{"@pid":"41/4809","text":"Dongchen Jiang"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Hall's Marriage Theorem.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/JiangN10","ee":"https://www.isa-afp.org/entries/Marriage.shtml","url":"https://dblp.org/rec/journals/afp/JiangN10"},
"url":"URL#3829059"
},
{
"@score":"1",
"@id":"3829060",
"info":{"authors":{"author":{"@pid":"60/11065","text":"Alexander Katovsky"}},"title":"Category Theory.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Katovsky10","ee":"https://www.isa-afp.org/entries/Category2.shtml","url":"https://dblp.org/rec/journals/afp/Katovsky10"},
"url":"URL#3829060"
},
{
"@score":"1",
"@id":"3829061",
"info":{"authors":{"author":[{"@pid":"45/6779","text":"Alexander Krauss"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Regular Sets and Expressions.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/KraussN10","ee":"https://www.isa-afp.org/entries/Regular-Sets.shtml","url":"https://dblp.org/rec/journals/afp/KraussN10"},
"url":"URL#3829061"
},
{
"@score":"1",
"@id":"3829062",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"Coinductive.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler10","ee":"https://www.isa-afp.org/entries/Coinductive.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler10"},
"url":"URL#3829062"
},
{
"@score":"1",
"@id":"3829063",
"info":{"authors":{"author":[{"@pid":"10/11066","text":"Rene Meis"},{"@pid":"69/11065","text":"Finn Nielsen"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"Binomial Heaps and Skew Binomial Heaps.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/MeisNL10","ee":"https://www.isa-afp.org/entries/Binomial-Heaps.shtml","url":"https://dblp.org/rec/journals/afp/MeisNL10"},
"url":"URL#3829063"
},
{
"@score":"1",
"@id":"3829064",
"info":{"authors":{"author":{"@pid":"88/11065","text":"René Neumann"}},"title":"Functional Binomial Queues.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Neumann10","ee":"https://www.isa-afp.org/entries/Binomial-Queues.shtml","url":"https://dblp.org/rec/journals/afp/Neumann10"},
"url":"URL#3829064"
},
{
"@score":"1",
"@id":"3829065",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"List Index.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow10","ee":"https://www.isa-afp.org/entries/List-Index.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow10"},
"url":"URL#3829065"
},
{
"@score":"1",
"@id":"3829066",
"info":{"authors":{"author":[{"@pid":"52/11066","text":"Benedikt Nordhoff"},{"@pid":"18/11065","text":"Stefan Körner"},{"@pid":"49/5258","text":"Peter Lammich"}]},"title":"Finger Trees.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/NordhoffKL10","ee":"https://www.isa-afp.org/entries/Finger-Trees.shtml","url":"https://dblp.org/rec/journals/afp/NordhoffKL10"},
"url":"URL#3829066"
},
{
"@score":"1",
"@id":"3829067",
"info":{"authors":{"author":[{"@pid":"p/ViorelPreoteasa","text":"Viorel Preoteasa"},{"@pid":"b/RJRBack","text":"Ralph-Johan Back"}]},"title":"Semantics and Data Refinement of Invariant Based Programs.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/PreoteasaB10","ee":"https://www.isa-afp.org/entries/DataRefinementIBP.shtml","url":"https://dblp.org/rec/journals/afp/PreoteasaB10"},
"url":"URL#3829067"
},
{
"@score":"1",
"@id":"3829068",
"info":{"authors":{"author":[{"@pid":"p/ViorelPreoteasa","text":"Viorel Preoteasa"},{"@pid":"b/RJRBack","text":"Ralph-Johan Back"}]},"title":"Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/PreoteasaB10a","ee":"https://www.isa-afp.org/entries/GraphMarkingIBP.shtml","url":"https://dblp.org/rec/journals/afp/PreoteasaB10a"},
"url":"URL#3829068"
},
{
"@score":"1",
"@id":"3829069",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Abstract Rewriting.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT10","ee":"https://www.isa-afp.org/entries/Abstract-Rewriting.shtml","url":"https://dblp.org/rec/journals/afp/SternagelT10"},
"url":"URL#3829069"
},
{
"@score":"1",
"@id":"3829070",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Executable Matrix Operations on Matrices of Arbitrary Dimensions.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT10a","ee":"https://www.isa-afp.org/entries/Matrix.shtml","url":"https://dblp.org/rec/journals/afp/SternagelT10a"},
"url":"URL#3829070"
},
{
"@score":"1",
"@id":"3829071",
"info":{"authors":{"author":[{"@pid":"33/287","text":"Christian Sternagel"},{"@pid":"89/2718","text":"René Thiemann"}]},"title":"Executable Multivariate Polynomials.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/SternagelT10b","ee":"https://www.isa-afp.org/entries/Polynomials.shtml","url":"https://dblp.org/rec/journals/afp/SternagelT10b"},
"url":"URL#3829071"
},
{
"@score":"1",
"@id":"3829072",
"info":{"authors":{"author":{"@pid":"93/11065","text":"Matthew Wampler-Doty"}},"title":"A Complete Proof of the Robbins Conjecture.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Wampler-Doty10","ee":"https://www.isa-afp.org/entries/Robbins-Conjecture.shtml","url":"https://dblp.org/rec/journals/afp/Wampler-Doty10"},
"url":"URL#3829072"
},
{
"@score":"1",
"@id":"3829073",
"info":{"authors":{"author":{"@pid":"76/3401","text":"Daniel Wasserrab"}},"title":"Information Flow Noninterference via Slicing.","venue":"Arch. Formal Proofs","volume":"2010","year":"2010","type":"Data and Artifacts","access":"open","key":"journals/afp/Wasserrab10","ee":"https://www.isa-afp.org/entries/InformationFlowSlicing.shtml","url":"https://dblp.org/rec/journals/afp/Wasserrab10"},
"url":"URL#3829073"
},
{
"@score":"1",
"@id":"4052663",
"info":{"authors":{"author":[{"@pid":"81/3747","text":"Stefan Berghofer"},{"@pid":"60/7268","text":"Markus Reiter"}]},"title":"Formalizing the Logic-Automaton Connection.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/BerghoferR09","ee":"https://www.isa-afp.org/entries/Presburger-Automata.shtml","url":"https://dblp.org/rec/journals/afp/BerghoferR09"},
"url":"URL#4052663"
},
{
"@score":"1",
"@id":"4052664",
"info":{"authors":{"author":{"@pid":"40/6432","text":"Peter Chapman"}},"title":"Invertibility in Sequent Calculi.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Chapman09","ee":"https://www.isa-afp.org/entries/SequentInvertibility.shtml","url":"https://dblp.org/rec/journals/afp/Chapman09"},
"url":"URL#4052664"
},
{
"@score":"1",
"@id":"4052665",
"info":{"authors":{"author":{"@pid":"20/6956","text":"Peter Gammie"}},"title":"The Worker/Wrapper Transformation.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Gammie09","ee":"https://www.isa-afp.org/entries/WorkerWrapper.shtml","url":"https://dblp.org/rec/journals/afp/Gammie09"},
"url":"URL#4052665"
},
{
"@score":"1",
"@id":"4052666",
"info":{"authors":{"author":{"@pid":"12/7815","text":"Armin Heller"}},"title":"A Fast SAT Solver for Isabelle in Standard ML.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Heller09","ee":"https://www.isa-afp.org/entries/DPT-SAT-Solver.shtml","url":"https://dblp.org/rec/journals/afp/Heller09"},
"url":"URL#4052666"
},
{
"@score":"1",
"@id":"4052667",
"info":{"authors":{"author":{"@pid":"69/3465","text":"Brian Huffman"}},"title":"Stream Fusion.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Huffman09","ee":"https://www.isa-afp.org/entries/Stream-Fusion.shtml","url":"https://dblp.org/rec/journals/afp/Huffman09"},
"url":"URL#4052667"
},
{
"@score":"1",
"@id":"4052668",
"info":{"authors":{"author":{"@pid":"16/11066","text":"Mark IJbema"}},"title":"Perfect Number Theorem.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Ijbema09","ee":"https://www.isa-afp.org/entries/Perfect-Number-Thm.shtml","url":"https://dblp.org/rec/journals/afp/Ijbema09"},
"url":"URL#4052668"
},
{
"@score":"1",
"@id":"4052669",
"info":{"authors":{"author":{"@pid":"73/4100","text":"Bart Kastermans"}},"title":"An Example of a Cofinitary Group in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Kastermans09","ee":"https://www.isa-afp.org/entries/CofGroups.shtml","url":"https://dblp.org/rec/journals/afp/Kastermans09"},
"url":"URL#4052669"
},
{
"@score":"1",
"@id":"4052670",
"info":{"authors":{"author":{"@pid":"49/5258","text":"Peter Lammich"}},"title":"Collections Framework.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Lammich09","ee":"https://www.isa-afp.org/entries/Collections.shtml","url":"https://dblp.org/rec/journals/afp/Lammich09"},
"url":"URL#4052670"
},
{
"@score":"1",
"@id":"4052671",
"info":{"authors":{"author":{"@pid":"49/5258","text":"Peter Lammich"}},"title":"Tree Automata.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Lammich09a","ee":"https://www.isa-afp.org/entries/Tree-Automata.shtml","url":"https://dblp.org/rec/journals/afp/Lammich09a"},
"url":"URL#4052671"
},
{
"@score":"1",
"@id":"4052672",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"Code Generation for Functions as Data.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler09","ee":"https://www.isa-afp.org/entries/FinFun.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler09"},
"url":"URL#4052672"
},
{
"@score":"1",
"@id":"4052673",
"info":{"authors":{"author":{"@pid":"89/2346-1","text":"Andrei Popescu 0001"}},"title":"Ordinals and Cardinals.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Popescu09","ee":"https://www.isa-afp.org/entries/Ordinals_and_Cardinals.shtml","url":"https://dblp.org/rec/journals/afp/Popescu09"},
"url":"URL#4052673"
},
{
"@score":"1",
"@id":"4052674",
"info":{"authors":{"author":{"@pid":"76/3401","text":"Daniel Wasserrab"}},"title":"Backing up Slicing - Verifying the Interprocedural Two-Phase Horwitz-Reps-Binkley Slicer.","venue":"Arch. Formal Proofs","volume":"2009","year":"2009","type":"Data and Artifacts","access":"open","key":"journals/afp/Wasserrab09","ee":"https://www.isa-afp.org/entries/HRB-Slicing.shtml","url":"https://dblp.org/rec/journals/afp/Wasserrab09"},
"url":"URL#4052674"
},
{
"@score":"1",
"@id":"4255515",
"info":{"authors":{"author":[{"@pid":"59/4489","text":"Klaus Aehlig"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Normalization by Evaluation.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/AehligN08","ee":"https://www.isa-afp.org/entries/NormByEval.shtml","url":"https://dblp.org/rec/journals/afp/AehligN08"},
"url":"URL#4255515"
},
{
"@score":"1",
"@id":"4255516",
"info":{"authors":{"author":[{"@pid":"b/LBeringer","text":"Lennart Beringer"},{"@pid":"h/MartinHofmann","text":"Martin Hofmann 0001"}]},"title":"Secure information flow and program logics.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/BeringerH08","ee":"https://www.isa-afp.org/entries/SIFPL.shtml","url":"https://dblp.org/rec/journals/afp/BeringerH08"},
"url":"URL#4255516"
},
{
"@score":"1",
"@id":"4255517",
"info":{"authors":{"author":[{"@pid":"b/LBeringer","text":"Lennart Beringer"},{"@pid":"h/MartinHofmann","text":"Martin Hofmann 0001"}]},"title":"A Bytecode Logic for JML and Types.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/BeringerH08a","ee":"https://www.isa-afp.org/entries/BytecodeLogicJmlTypes.shtml","url":"https://dblp.org/rec/journals/afp/BeringerH08a"},
"url":"URL#4255517"
},
{
"@score":"1",
"@id":"4255518",
"info":{"authors":{"author":{"@pid":"52/6913","text":"Jasmin Christian Blanchette"}},"title":"The Textbook Proof of Huffman's Algorithm.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Blanchette08","ee":"https://www.isa-afp.org/entries/Huffman.shtml","url":"https://dblp.org/rec/journals/afp/Blanchette08"},
"url":"URL#4255518"
},
{
"@score":"1",
"@id":"4255519",
"info":{"authors":{"author":{"@pid":"20/6956","text":"Peter Gammie"}},"title":"Some classical results in Social Choice Theory.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Gammie08","ee":"https://www.isa-afp.org/entries/SenSocialChoice.shtml","url":"https://dblp.org/rec/journals/afp/Gammie08"},
"url":"URL#4255519"
},
{
"@score":"1",
"@id":"4255520",
"info":{"authors":{"author":{"@pid":"32/881","text":"Filip Maric"}},"title":"Formal Verification of Modern SAT Solvers.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Maric08","ee":"https://www.isa-afp.org/entries/SATSolverVerification.shtml","url":"https://dblp.org/rec/journals/afp/Maric08"},
"url":"URL#4255520"
},
{
"@score":"1",
"@id":"4255521",
"info":{"authors":{"author":{"@pid":"36/11066","text":"Michael Nedzelsky"}},"title":"Recursion Theory I.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Nedzelsky08","ee":"https://www.isa-afp.org/entries/Recursion-Theory-I.shtml","url":"https://dblp.org/rec/journals/afp/Nedzelsky08"},
"url":"URL#4255521"
},
{
"@score":"1",
"@id":"4255522",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Quantifier Elimination for Linear Arithmetic.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow08","ee":"https://www.isa-afp.org/entries/LinearQuantifierElim.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow08"},
"url":"URL#4255522"
},
{
"@score":"1",
"@id":"4255523",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Fun With Functions.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow08a","ee":"https://www.isa-afp.org/entries/FunWithFunctions.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow08a"},
"url":"URL#4255523"
},
{
"@score":"1",
"@id":"4255524",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Arrow and Gibbard-Satterthwaite.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow08b","ee":"https://www.isa-afp.org/entries/ArrowImpossibilityGS.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow08b"},
"url":"URL#4255524"
},
{
"@score":"1",
"@id":"4255525",
"info":{"authors":{"author":[{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"},{"@pid":"p/LCPaulson","text":"Lawrence C. Paulson"}]},"title":"Fun With Tilings.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/NipkowP08","ee":"https://www.isa-afp.org/entries/FunWithTilings.shtml","url":"https://dblp.org/rec/journals/afp/NipkowP08"},
"url":"URL#4255525"
},
{
"@score":"1",
"@id":"4255526",
"info":{"authors":{"author":[{"@pid":"43/2191","text":"Veronika Ortner"},{"@pid":"88/7021","text":"Norbert Schirmer"}]},"title":"BDD Normalisation.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/OrtnerS08","ee":"https://www.isa-afp.org/entries/BDD.shtml","url":"https://dblp.org/rec/journals/afp/OrtnerS08"},
"url":"URL#4255526"
},
{
"@score":"1",
"@id":"4255527",
"info":{"authors":{"author":{"@pid":"88/7021","text":"Norbert Schirmer"}},"title":"A Sequential Imperative Programming Language Syntax, Semantics, Hoare Logics and Verification Environment.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Schirmer08","ee":"https://www.isa-afp.org/entries/Simpl.shtml","url":"https://dblp.org/rec/journals/afp/Schirmer08"},
"url":"URL#4255527"
},
{
"@score":"1",
"@id":"4255528",
"info":{"authors":{"author":[{"@pid":"s/GregorSnelting","text":"Gregor Snelting"},{"@pid":"76/3401","text":"Daniel Wasserrab"}]},"title":"A Correctness Proof for the Volpano/Smith Security Typing System.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/SneltingW08","ee":"https://www.isa-afp.org/entries/VolpanoSmith.shtml","url":"https://dblp.org/rec/journals/afp/SneltingW08"},
"url":"URL#4255528"
},
{
"@score":"1",
"@id":"4255529",
"info":{"authors":{"author":{"@pid":"76/3401","text":"Daniel Wasserrab"}},"title":"Towards Certified Slicing.","venue":"Arch. Formal Proofs","volume":"2008","year":"2008","type":"Data and Artifacts","access":"open","key":"journals/afp/Wasserrab08","ee":"https://www.isa-afp.org/entries/Slicing.shtml","url":"https://dblp.org/rec/journals/afp/Wasserrab08"},
"url":"URL#4255529"
},
{
"@score":"1",
"@id":"4444693",
"info":{"authors":{"author":{"@pid":"81/3747","text":"Stefan Berghofer"}},"title":"First-Order Logic According to Fitting.","venue":"Arch. Formal Proofs","volume":"2007","year":"2007","type":"Data and Artifacts","access":"open","key":"journals/afp/Berghofer07","ee":"https://www.isa-afp.org/entries/FOL-Fitting.shtml","url":"https://dblp.org/rec/journals/afp/Berghofer07"},
"url":"URL#4444693"
},
{
"@score":"1",
"@id":"4444694",
"info":{"authors":{"author":{"@pid":"81/3747","text":"Stefan Berghofer"}},"title":"POPLmark Challenge Via de Bruijn Indices.","venue":"Arch. Formal Proofs","volume":"2007","year":"2007","type":"Data and Artifacts","access":"open","key":"journals/afp/Berghofer07a","ee":"https://www.isa-afp.org/entries/POPLmark-deBruijn.shtml","url":"https://dblp.org/rec/journals/afp/Berghofer07a"},
"url":"URL#4444694"
},
{
"@score":"1",
"@id":"4444695",
"info":{"authors":{"author":{"@pid":"13/6161","text":"Sascha Böhme"}},"title":"Much Ado About Two.","venue":"Arch. Formal Proofs","volume":"2007","year":"2007","type":"Data and Artifacts","access":"open","key":"journals/afp/Bohme07","ee":"https://www.isa-afp.org/entries/MuchAdoAboutTwo.shtml","url":"https://dblp.org/rec/journals/afp/Bohme07"},
"url":"URL#4444695"
},
{
"@score":"1",
"@id":"4444696",
"info":{"authors":{"author":{"@pid":"42/2592","text":"Hidetsune Kobayashi"}},"title":"Fundamental Properties of Valuation Theory and Hensel's Lemma.","venue":"Arch. Formal Proofs","volume":"2007","year":"2007","type":"Data and Artifacts","access":"open","key":"journals/afp/Kobayashi07","ee":"https://www.isa-afp.org/entries/Valuation.shtml","url":"https://dblp.org/rec/journals/afp/Kobayashi07"},
"url":"URL#4444696"
},
{
"@score":"1",
"@id":"4444697",
"info":{"authors":{"author":[{"@pid":"49/5258","text":"Peter Lammich"},{"@pid":"m/MarkusMullerOhm","text":"Markus Müller-Olm"}]},"title":"Formalization of Conflict Analysis of Programs with Procedures, Thread Creation, and Monitors.","venue":"Arch. Formal Proofs","volume":"2007","year":"2007","type":"Data and Artifacts","access":"open","key":"journals/afp/LammichM07","ee":"https://www.isa-afp.org/entries/Program-Conflict-Analysis.shtml","url":"https://dblp.org/rec/journals/afp/LammichM07"},
"url":"URL#4444697"
},
{
"@score":"1",
"@id":"4444698",
"info":{"authors":{"author":{"@pid":"43/1499","text":"Andreas Lochbihler"}},"title":"Jinja with Threads.","venue":"Arch. Formal Proofs","volume":"2007","year":"2007","type":"Data and Artifacts","access":"open","key":"journals/afp/Lochbihler07","ee":"https://www.isa-afp.org/entries/JinjaThreads.shtml","url":"https://dblp.org/rec/journals/afp/Lochbihler07"},
"url":"URL#4444698"
},
{
"@score":"1",
"@id":"4444699",
"info":{"authors":{"author":{"@pid":"86/11065","text":"Roelof Oosterhuis"}},"title":"Sums of Two and Four Squares.","venue":"Arch. Formal Proofs","volume":"2007","year":"2007","type":"Data and Artifacts","access":"open","key":"journals/afp/Oosterhuis07","ee":"https://www.isa-afp.org/entries/SumSquares.shtml","url":"https://dblp.org/rec/journals/afp/Oosterhuis07"},
"url":"URL#4444699"
},
{
"@score":"1",
"@id":"4444700",
"info":{"authors":{"author":{"@pid":"86/11065","text":"Roelof Oosterhuis"}},"title":"Fermat's Last Theorem for Exponents 3 and 4 and the Parametrisation of Pythagorean Triples.","venue":"Arch. Formal Proofs","volume":"2007","year":"2007","type":"Data and Artifacts","access":"open","key":"journals/afp/Oosterhuis07a","ee":"https://www.isa-afp.org/entries/Fermat3_4.shtml","url":"https://dblp.org/rec/journals/afp/Oosterhuis07a"},
"url":"URL#4444700"
},
{
"@score":"1",
"@id":"4619588",
"info":{"authors":{"author":{"@pid":"07/5771","text":"Damián Barsotti"}},"title":"Instances of Schneider's generalized protocol of clock synchronization.","venue":"Arch. Formal Proofs","volume":"2006","year":"2006","type":"Data and Artifacts","access":"open","key":"journals/afp/Barsotti06","ee":"https://www.isa-afp.org/entries/ClockSynchInst.shtml","url":"https://dblp.org/rec/journals/afp/Barsotti06"},
"url":"URL#4619588"
},
{
"@score":"1",
"@id":"4619589",
"info":{"authors":{"author":[{"@pid":"01/3313","text":"Gertrud Bauer"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Flyspeck I - Tame Graphs.","venue":"Arch. Formal Proofs","volume":"2006","year":"2006","type":"Data and Artifacts","access":"open","key":"journals/afp/BauerN06","ee":"https://www.isa-afp.org/entries/Flyspeck-Tame.shtml","url":"https://dblp.org/rec/journals/afp/BauerN06"},
"url":"URL#4619589"
},
{
"@score":"1",
"@id":"4619590",
"info":{"authors":{"author":[{"@pid":"15/3253","text":"J. Nathan Foster"},{"@pid":"00/6362","text":"Dimitrios Vytiniotis"}]},"title":"A Theory of Featherweight Java in Isabelle/HOL.","venue":"Arch. Formal Proofs","volume":"2006","year":"2006","type":"Data and Artifacts","access":"open","key":"journals/afp/FosterV06","ee":"https://www.isa-afp.org/entries/FeatherweightJava.shtml","url":"https://dblp.org/rec/journals/afp/FosterV06"},
"url":"URL#4619590"
},
{
"@score":"1",
"@id":"4619591",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Abstract Hoare Logics.","venue":"Arch. Formal Proofs","volume":"2006","year":"2006","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow06","ee":"https://www.isa-afp.org/entries/Abstract-Hoare-Logics.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow06"},
"url":"URL#4619591"
},
{
"@score":"1",
"@id":"4619592",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Hotel Key Card System.","venue":"Arch. Formal Proofs","volume":"2006","year":"2006","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow06a","ee":"https://www.isa-afp.org/entries/HotelKeyCards.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow06a"},
"url":"URL#4619592"
},
{
"@score":"1",
"@id":"4619593",
"info":{"authors":{"author":{"@pid":"20/7569","text":"Benjamin Porter"}},"title":"Cauchy's Mean Theorem and the Cauchy-Schwarz Inequality.","venue":"Arch. Formal Proofs","volume":"2006","year":"2006","type":"Data and Artifacts","access":"open","key":"journals/afp/Porter06","ee":"https://www.isa-afp.org/entries/Cauchy.shtml","url":"https://dblp.org/rec/journals/afp/Porter06"},
"url":"URL#4619593"
},
{
"@score":"1",
"@id":"4619594",
"info":{"authors":{"author":{"@pid":"76/3401","text":"Daniel Wasserrab"}},"title":"CoreC++.","venue":"Arch. Formal Proofs","volume":"2006","year":"2006","type":"Data and Artifacts","access":"open","key":"journals/afp/Wasserrab06","ee":"https://www.isa-afp.org/entries/CoreC++.shtml","url":"https://dblp.org/rec/journals/afp/Wasserrab06"},
"url":"URL#4619594"
},
{
"@score":"1",
"@id":"4773997",
"info":{"authors":{"author":{"@pid":"58/137","text":"Clemens Ballarin"}},"title":"Fast Fourier Transform.","venue":"Arch. Formal Proofs","volume":"2005","year":"2005","type":"Data and Artifacts","access":"open","key":"journals/afp/Ballarin05","ee":"https://www.isa-afp.org/entries/FFT.shtml","url":"https://dblp.org/rec/journals/afp/Ballarin05"},
"url":"URL#4773997"
},
{
"@score":"1",
"@id":"4773998",
"info":{"authors":{"author":{"@pid":"69/3465","text":"Brian Huffman"}},"title":"Countable Ordinals.","venue":"Arch. Formal Proofs","volume":"2005","year":"2005","type":"Data and Artifacts","access":"open","key":"journals/afp/Huffman05","ee":"https://www.isa-afp.org/entries/Ordinal.shtml","url":"https://dblp.org/rec/journals/afp/Huffman05"},
"url":"URL#4773998"
},
{
"@score":"1",
"@id":"4773999",
"info":{"authors":{"author":[{"@pid":"91/5144","text":"Mauro Jaskelioff"},{"@pid":"52/4601","text":"Stephan Merz"}]},"title":"Proving the Correctness of Disk Paxos.","venue":"Arch. Formal Proofs","volume":"2005","year":"2005","type":"Data and Artifacts","access":"open","key":"journals/afp/JaskelioffM05","ee":"https://www.isa-afp.org/entries/DiskPaxos.shtml","url":"https://dblp.org/rec/journals/afp/JaskelioffM05"},
"url":"URL#4773999"
},
{
"@score":"1",
"@id":"4774000",
"info":{"authors":{"author":[{"@pid":"74/2171","text":"Gerwin Klein"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Jinja is not Java.","venue":"Arch. Formal Proofs","volume":"2005","year":"2005","type":"Data and Artifacts","access":"open","key":"journals/afp/KleinN05","ee":"https://www.isa-afp.org/entries/Jinja.shtml","url":"https://dblp.org/rec/journals/afp/KleinN05"},
"url":"URL#4774000"
},
{
"@score":"1",
"@id":"4774001",
"info":{"authors":{"author":[{"@pid":"77/10392","text":"Christina Lindenberg"},{"@pid":"27/1231","text":"Kai Wirt"}]},"title":"SHA1, RSA, PSS and more.","venue":"Arch. Formal Proofs","volume":"2005","year":"2005","type":"Data and Artifacts","access":"open","key":"journals/afp/LindenbergW05","ee":"https://www.isa-afp.org/entries/RSAPSS.shtml","url":"https://dblp.org/rec/journals/afp/LindenbergW05"},
"url":"URL#4774001"
},
{
"@score":"1",
"@id":"4774002",
"info":{"authors":{"author":{"@pid":"10/4099","text":"Greg O'Keefe"}},"title":"Category Theory to Yoneda's Lemma.","venue":"Arch. Formal Proofs","volume":"2005","year":"2005","type":"Data and Artifacts","access":"open","key":"journals/afp/OKeefe05","ee":"https://www.isa-afp.org/entries/Category.shtml","url":"https://dblp.org/rec/journals/afp/OKeefe05"},
"url":"URL#4774002"
},
{
"@score":"1",
"@id":"4774003",
"info":{"authors":{"author":[{"@pid":"30/6754","text":"Nicole Rauch"},{"@pid":"88/7021","text":"Norbert Schirmer"}]},"title":"Jive Data and Store Model.","venue":"Arch. Formal Proofs","volume":"2005","year":"2005","type":"Data and Artifacts","access":"open","key":"journals/afp/RauchS05","ee":"https://www.isa-afp.org/entries/JiveDataStoreModel.shtml","url":"https://dblp.org/rec/journals/afp/RauchS05"},
"url":"URL#4774003"
},
{
"@score":"1",
"@id":"4774004",
"info":{"authors":{"author":{"@pid":"t/AlwenTiu","text":"Alwen Tiu"}},"title":"Formalization of a Generalized Protocol for Clock Synchronization.","venue":"Arch. Formal Proofs","volume":"2005","year":"2005","type":"Data and Artifacts","access":"open","key":"journals/afp/Tiu05","ee":"https://www.isa-afp.org/entries/GenClock.shtml","url":"https://dblp.org/rec/journals/afp/Tiu05"},
"url":"URL#4774004"
},
{
"@score":"1",
"@id":"4907617",
"info":{"authors":{"author":{"@pid":"19/4728","text":"Stefan Friedrich 0001"}},"title":"Lazy Lists II.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Friedrich04","ee":"https://www.isa-afp.org/entries/Lazy-Lists-II.shtml","url":"https://dblp.org/rec/journals/afp/Friedrich04"},
"url":"URL#4907617"
},
{
"@score":"1",
"@id":"4907618",
"info":{"authors":{"author":{"@pid":"19/4728","text":"Stefan Friedrich 0001"}},"title":"Topology.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Friedrich04a","ee":"https://www.isa-afp.org/entries/Topology.shtml","url":"https://dblp.org/rec/journals/afp/Friedrich04a"},
"url":"URL#4907618"
},
{
"@score":"1",
"@id":"4907619",
"info":{"authors":{"author":{"@pid":"74/2171","text":"Gerwin Klein"}},"title":"Example Submission.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Klein04","ee":"https://www.isa-afp.org/entries/Example-Submission.shtml","url":"https://dblp.org/rec/journals/afp/Klein04"},
"url":"URL#4907619"
},
{
"@score":"1",
"@id":"4907620",
"info":{"authors":{"author":[{"@pid":"42/2592","text":"Hidetsune Kobayashi"},{"@pid":"93/6789","text":"L. Chen"},{"@pid":"57/4268","text":"Hirokazu Murao"}]},"title":"Groups, Rings and Modules.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/KobayashiCM04","ee":"https://www.isa-afp.org/entries/Group-Ring-Module.shtml","url":"https://dblp.org/rec/journals/afp/KobayashiCM04"},
"url":"URL#4907620"
},
{
"@score":"1",
"@id":"4907621",
"info":{"authors":{"author":{"@pid":"k/ViktorKuncak","text":"Viktor Kuncak"}},"title":"Binary Search Trees.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Kuncak04","ee":"https://www.isa-afp.org/entries/BinarySearchTree.shtml","url":"https://dblp.org/rec/journals/afp/Kuncak04"},
"url":"URL#4907621"
},
{
"@score":"1",
"@id":"4907622",
"info":{"authors":{"author":[{"@pid":"53/1190","text":"James Margetson"},{"@pid":"r/TomRidge","text":"Tom Ridge"}]},"title":"Completeness theorem.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/MargetsonR04","ee":"https://www.isa-afp.org/entries/Completeness.shtml","url":"https://dblp.org/rec/journals/afp/MargetsonR04"},
"url":"URL#4907622"
},
{
"@score":"1",
"@id":"4907623",
"info":{"authors":{"author":[{"@pid":"21/4719","text":"Wolfgang Naraschewski"},{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}]},"title":"Mini ML.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/NaraschewskiN04","ee":"https://www.isa-afp.org/entries/MiniML.shtml","url":"https://dblp.org/rec/journals/afp/NaraschewskiN04"},
"url":"URL#4907623"
},
{
"@score":"1",
"@id":"4907624",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Functional Automata.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow04","ee":"https://www.isa-afp.org/entries/Functional-Automata.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow04"},
"url":"URL#4907624"
},
{
"@score":"1",
"@id":"4907625",
"info":{"authors":{"author":{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"}},"title":"Compiling Exceptions Correctly.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Nipkow04a","ee":"https://www.isa-afp.org/entries/Compiling-Exceptions-Correctly.shtml","url":"https://dblp.org/rec/journals/afp/Nipkow04a"},
"url":"URL#4907625"
},
{
"@score":"1",
"@id":"4907626",
"info":{"authors":{"author":[{"@pid":"n/TobiasNipkow","text":"Tobias Nipkow"},{"@pid":"38/2162","text":"Cornelia Pusch"}]},"title":"AVL Trees.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/NipkowP04","ee":"https://www.isa-afp.org/entries/AVL-Trees.shtml","url":"https://dblp.org/rec/journals/afp/NipkowP04"},
"url":"URL#4907626"
},
{
"@score":"1",
"@id":"4907627",
"info":{"authors":{"author":[{"@pid":"74/11065","text":"Toshiaki Nishihara"},{"@pid":"27/2249","text":"Yasuhiko Minamide"}]},"title":"Depth First Search.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/NishiharaM04","ee":"https://www.isa-afp.org/entries/Depth-First-Search.shtml","url":"https://dblp.org/rec/journals/afp/NishiharaM04"},
"url":"URL#4907627"
},
{
"@score":"1",
"@id":"4907628",
"info":{"authors":{"author":{"@pid":"01/322-1","text":"Stefan Richter 0001"}},"title":"Integration theory and random variables.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Richter04","ee":"https://www.isa-afp.org/entries/Integration.shtml","url":"https://dblp.org/rec/journals/afp/Richter04"},
"url":"URL#4907628"
},
{
"@score":"1",
"@id":"4907629",
"info":{"authors":{"author":{"@pid":"r/TomRidge","text":"Tom Ridge"}},"title":"Ramsey's theorem, infinitary version.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Ridge04","ee":"https://www.isa-afp.org/entries/Ramsey-Infinite.shtml","url":"https://dblp.org/rec/journals/afp/Ridge04"},
"url":"URL#4907629"
},
{
"@score":"1",
"@id":"4907630",
"info":{"authors":{"author":{"@pid":"r/TomRidge","text":"Tom Ridge"}},"title":"A Mechanically Verified, Efficient, Sound and Complete Theorem Prover For First Order Logic.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/Ridge04a","ee":"https://www.isa-afp.org/entries/Verified-Prover.shtml","url":"https://dblp.org/rec/journals/afp/Ridge04a"},
"url":"URL#4907630"
},
{
"@score":"1",
"@id":"4907631",
"info":{"authors":{"author":[{"@pid":"74/3817","text":"Karen Zee"},{"@pid":"k/ViktorKuncak","text":"Viktor Kuncak"}]},"title":"File Refinement.","venue":"Arch. Formal Proofs","volume":"2004","year":"2004","type":"Data and Artifacts","access":"open","key":"journals/afp/ZeeK04","ee":"https://www.isa-afp.org/entries/FileRefinement.shtml","url":"https://dblp.org/rec/journals/afp/ZeeK04"},
"url":"URL#4907631"
}
]
}
}
}