Filters








5,200 Hits in 8.1 sec

Instantiation of existentially quantified variables in inductive specification proofs [chapter]

Brigitte Pientka, Christoph Kreitz
<span title="">1998</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We present an automatic approach for instantiating existentially quantified variables in inductive specifications proofs.  ...  Our approach uses first-order meta-variables in place of existentially quantified variables and combines logical proof search with rippling techniques.  ...  Automatic Instantiation of Meta-variables Our research interest is to automate key steps such as the instantiation of the existentially quantified variable in sequent proofs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0055917">doi:10.1007/bfb0055917</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pzhuwzef4nbctofqgxukomsryu">fatcat:pzhuwzef4nbctofqgxukomsryu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809214420/http://www.cs.cornell.edu/home/kreitz/PDF/98aisc-rippling.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/54/1b/541b8a9f5bdc25403e050003edd588d55261828d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0055917"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Bounded Quantifier Instantiation for Checking Inductive Invariants [article]

Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham
<span title="2018-12-10">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We consider the problem of checking whether a proposed invariant ϕ expressed in first-order logic with quantifier alternation is inductive, i.e. preserved by a piece of code.  ...  This paper studies Bounded-Horizon instantiation, a natural method for guaranteeing the termination of SMT solvers. The method bounds the depth of terms used in the quantifier instantiation process.  ...  For every existentially quantified variable x in ¬ I, we add a special program variable sk x which can be used in local instantiations, enhancing their power to prove that I is inductive.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1710.08668v2">arXiv:1710.08668v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yql7qhje7zbbxpuh4jhwj2hnqq">fatcat:yql7qhje7zbbxpuh4jhwj2hnqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823045821/https://arxiv.org/pdf/1710.08668v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/36/43/364366cb50ba4b4a30dc7138a445313eca5fd4a6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1710.08668v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Matrix-Based Inductive Theorem Proving [chapter]

Christoph Kreitz, Brigitte Pientka
<span title="">2000</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The selection of appropriate connections in a matrix proof is guided by the symmetries between induction hypothesis and induction conclusion while unification is extended by a rippling/reverse-rippling  ...  We illustrate the combined approach by discussing several inductive proofs for the integer square root problem.  ...  There have been other approaches to automate the instantiation of quantified variables in inductive proofs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/10722086_24">doi:10.1007/10722086_24</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pqhubc45kvhirkql27ig5bejou">fatcat:pqhubc45kvhirkql27ig5bejou</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809115929/http://www.cs.uni-potsdam.de/ti/kreitz/PDF/00tableaux-induction.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bb/f6/bbf634ea964b91cbd4d42f2bf38fb4e61c98ccfc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/10722086_24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Constructing Induction Rules for Deductive Synthesis Proofs

Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques Fleuriot
<span title="">2006</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uy5mv2ncw5eahkdx47hkrglxmm" style="color: black;">Electronical Notes in Theoretical Computer Science</a> </i> &nbsp;
We show that a combination of rippling and the use of meta-variables as a least-commitment device can provide such novelty.  ...  Synthesis of programs with iteration or recursion requires inductive proof, but standard techniques for the construction of appropriate induction rules are restricted to recycling the recursive structure  ...  In this paper we address one such challenge: the choice of induction rules in the presence of existential quantifiers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2005.08.003">doi:10.1016/j.entcs.2005.08.003</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wgcdnm2yxvdl3bxrt2wptuuezi">fatcat:wgcdnm2yxvdl3bxrt2wptuuezi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080418212724/http://homepages.inf.ed.ac.uk/ldixon/papers/clase-05-dedsynth.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5f/fe/5ffefe7db5277c5f344af3d3f71e56df8f84bd5f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.entcs.2005.08.003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Bounded Quantifier Instantiation for Checking Inductive Invariants [chapter]

Yotam M. Y. Feldman, Oded Padon, Neil Immerman, Mooly Sagiv, Sharon Shoham
<span title="">2017</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We consider the problem of checking whether a proposed invariant ϕ expressed in first-order logic with quantifier alternation is inductive, i.e. preserved by a piece of code.  ...  This paper studies Bounded-Horizon instantiation, a natural method for guaranteeing the termination of SMT solvers. The method bounds the depth of terms used in the quantifier instantiation process.  ...  Instantiations are performed by introducing existentially quantified variables to the program and using assume statements to make these variables function as witnesses for a tuple of variables that instantiate  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-54577-5_5">doi:10.1007/978-3-662-54577-5_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l3ohabtkyvaupbp26ykjgw7vge">fatcat:l3ohabtkyvaupbp26ykjgw7vge</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218151634/http://pdfs.semanticscholar.org/0ce5/504d9be22dfe444821584eac187d07e4556d.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0c/e5/0ce5504d9be22dfe444821584eac187d07e4556d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-54577-5_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Logic Program Synthesis in a Higher-Order Setting [chapter]

David Lacey, Julian Richardson, Alan Smail
<span title="">2000</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations.  ...  The system has been implemented within the proof planning system λClam.  ...  The research was supported by EPSRC grant GR/M45030, and EPSRC funding for David Lacey's MSc in Artificial Intelligence.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44957-4_6">doi:10.1007/3-540-44957-4_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/24o64zh5abdero5uagownflvka">fatcat:24o64zh5abdero5uagownflvka</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161225032117/http://dream.inf.ed.ac.uk/publications/98-00/lps_ho.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/13/be/13be53f65ff27857289bdeecd050a16fbf599eb0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44957-4_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Automated reasoning with quantified formulae

David Greve
<span title="">2009</span> <i title="ACM Press"> Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications - ACL2 &#39;09 </i> &nbsp;
ACL2 allows users to define predicates whose logical behavior mimics that of universally or existentially quantified formulae. Proof support for such quantification, however, is quite limited.  ...  We present an ACL2 framework that employs tables, computed hints and clause processing to identify quantified formulae and to skolemize or instantiate them when possible.  ...  Instantiation is the name given to the process of deriving a new formula from a universally quantified formula by replacing each occurrence of a quantified variable with a specific instance.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1637837.1637855">doi:10.1145/1637837.1637855</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fadir2w2vrbhpduvcpawykveay">fatcat:fadir2w2vrbhpduvcpawykveay</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809075743/http://www.cs.utexas.edu/users/sandip/acl2-09/final/21/21.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/43/47/4347f26252165c82188d2c8ec5548c71f35bd59b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1637837.1637855"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A general technique for automatically optimizing programs through the use of proof plans [chapter]

Peter Madden, Ian Green
<span title="">1995</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In particular, the way in which meta-variables are introduced, via gen-MoR, into the proof of the goal statement(s) specifying the program being synthesized.  ...  We significantly extend the mechanism by which MOR operates by allowing for the use of higher-order meta-variables in rewrite rules in addition to those introduced via the proof plan application.  ...  The step case is completed by stripping of the universal quantifiers and instantiating the w in the induction hypothesis to hd :: w in the induction conclusion (reducing the induction step to true since  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60156-2_6">doi:10.1007/3-540-60156-2_6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2qc6rwkbknbzjfbidypieybqpm">fatcat:2qc6rwkbknbzjfbidypieybqpm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170817144712/http://pubman.mpdl.mpg.de/pubman/item/escidoc:1834198/component/escidoc:2060435/MPI-I-94-239.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9d/70/9d70068c0c5b10bf839b2150d7cf1f2cb3fc1324.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-60156-2_6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Complete and easy bidirectional typechecking for higher-rank polymorphism

Jana Dunfield, Neelakantan R. Krishnaswami
<span title="2013-11-12">2013</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
We give a declarative, bidirectional account of higher-rank polymorphism, grounded in proof theory; this calculus enjoys many properties such as η-reduction and predictability of annotations.  ...  Following design principles from proof theory, bidirectional typing can be applied to many type constructs.  ...  First, as a specification of type checking, we give a declarative bidirectional type system which guesses all quantifier instantiations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2544174.2500582">doi:10.1145/2544174.2500582</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n52pvam4rnaf5ai7xbb32w6rx4">fatcat:n52pvam4rnaf5ai7xbb32w6rx4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922104830/http://www.cs.cmu.edu/~joshuad/papers/bidir/Dunfield13_bidir.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/36/61/36612665d9a2bde90107d9fb39924d34712e863d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2544174.2500582"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Complete and easy bidirectional typechecking for higher-rank polymorphism

Jana Dunfield, Neelakantan R. Krishnaswami
<span title="">2013</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ug3n3jfg4jdcpdvbrhe3m4txqa" style="color: black;">Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP &#39;13</a> </i> &nbsp;
We give a declarative, bidirectional account of higher-rank polymorphism, grounded in proof theory; this calculus enjoys many properties such as η-reduction and predictability of annotations.  ...  Following design principles from proof theory, bidirectional typing can be applied to many type constructs.  ...  First, as a specification of type checking, we give a declarative bidirectional type system which guesses all quantifier instantiations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2500365.2500582">doi:10.1145/2500365.2500582</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icfp/DunfieldK13.html">dblp:conf/icfp/DunfieldK13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qjrde34ydfgl3huheia3anl2au">fatcat:qjrde34ydfgl3huheia3anl2au</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922104830/http://www.cs.cmu.edu/~joshuad/papers/bidir/Dunfield13_bidir.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/36/61/36612665d9a2bde90107d9fb39924d34712e863d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2500365.2500582"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Formal methods for automated program improvement [chapter]

Peter Madden
<span title="">1994</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper we report on novel research concerning: (1) the exploitation of synthesis proofs for the purposes of automatie program optimization by the transformation of proofs, andj (2) the automatie  ...  The exploitation of the proofs-as-programs paradigm lends our approach numerous advantages over more traditional approaches to program improvement.  ...  In both case the meta-variables areemployed according to characteristics of the type of optimization desired.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58467-6_32">doi:10.1007/3-540-58467-6_32</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jckmgdfumngshiffwn7ibcsc5q">fatcat:jckmgdfumngshiffwn7ibcsc5q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809143348/http://pubman.mpdl.mpg.de/pubman/item/escidoc:1834199/component/escidoc:2060426/MPI-I-94-238.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/74/62/74621922ab7fb043f194e2598ac8dd3805f427be.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-58467-6_32"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

SMT-based verification of parameterized systems

Arie Gurfinkel, Sharon Shoham, Yuri Meshman
<span title="">2016</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dj7g645z6zfl5lut4iwy5walyu" style="color: black;">Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering - FSE 2016</a> </i> &nbsp;
We show that deciding whether a parameterized system has a universally quantified inductive invariant is reducible to satisfiability of (non-linear) Constraint Horn Clauses (CHC).  ...  The reduction is used both in deductive and automated verification, the difference is only in whether the user or the solver provides candidates for inductive invariants.  ...  Our solution strategy is to (a) fix the number of quantifiers expected in the invariant, (b) instantiate the quantifiers eagerly, and (c) use existing solvers for inference of quantifier-free safe inductive  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2950290.2950330">doi:10.1145/2950290.2950330</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigsoft/GurfinkelSM16.html">dblp:conf/sigsoft/GurfinkelSM16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5wgwysestzcxvgqkguekrdigsa">fatcat:5wgwysestzcxvgqkguekrdigsa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190218133505/https://static.aminer.org/pdf/20170130/pdfs/sigsoft/r0yuj4xh3zi9zwslpbcxqg1r6coedn8a.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b6/26/b6263dc481f311c625f7f953732e51020854ee72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2950290.2950330"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays [article]

Makai Mann, Ahmed Irfan, Alberto Griggio, Oded Padon, Clark Barrett
<span title="2021-01-18">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We develop a framework for model checking infinite-state systems by automatically augmenting them with auxiliary variables, enabling quantifier-free induction proofs for systems that would otherwise require  ...  Our framework can thus, in many cases, reduce inductive reasoning with quantifiers and arrays to quantifier-free and array-free reasoning.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.06825v1">arXiv:2101.06825v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rfj5t4w42radrbzhvnw3hdzprq">fatcat:rfj5t4w42radrbzhvnw3hdzprq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210120105519/https://arxiv.org/pdf/2101.06825v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/df/c1/dfc1675eec6dfbd6187051c8a38cfe4617b7103d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.06825v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Quantified types in an imperative language

Dan Grossman
<span title="2006-05-01">2006</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4hplau6wtnhnfnqt2t7vbri6vm" style="color: black;">ACM Transactions on Programming Languages and Systems</a> </i> &nbsp;
We develop a formal abstract machine and type-safety proof that captures the essence of type variables at the C level.  ...  In fact, Cyclone type variables and quantified types are essential to the entire type system.  ...  Instead, the i th type variable has the same kind as the i th existentially quantified type variable in the type of the package unpacked.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1133651.1133653">doi:10.1145/1133651.1133653</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/silqcp35ezdqpin75nkeshwdtq">fatcat:silqcp35ezdqpin75nkeshwdtq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829112912/https://homes.cs.washington.edu/~djg/papers/qtil.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f2/4c/f24c0eb13cf8cd1d8b5ccb2c190cc213eaa2dea1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1133651.1133653"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Structured Specifications for Better Verification of Heap-Manipulating Programs [chapter]

Cristian Gherghina, Cristina David, Shengchao Qin, Wei-Ngan Chin
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
At the end of the entailment proving, the variables that were marked as late-instantiated are existentially quantified in the residue state.  ...  −EXIST] adds the existentially quantified variables v * to the set V .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-21437-0_29">doi:10.1007/978-3-642-21437-0_29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/auho75jqinfqvkipnydcas6zj4">fatcat:auho75jqinfqvkipnydcas6zj4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721003207/https://tees.openrepository.com/tees/bitstream/10149/141503/2/141503.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/1e/d41ecb27c7d9bd80b3c5d1b4b0293941643d3f2b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-21437-0_29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 5,200 results