Filters








93,606 Hits in 3.3 sec

Corpse reviver: sound and efficient gradual typing via contract verification

Cameron Moy, Phúc C. Nguyễn, Sam Tobin-Hochstadt, David Van Horn
<span title="2021-01-04">2021</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dqy7qc7jkzal5bz3gueys3siz4" style="color: black;">Proceedings of the ACM on Programming Languages (PACMPL)</a> </i> &nbsp;
Gradually typed programming languages permit the incremental addition of static types to untyped programs.  ...  Our key insight is that while untyped code cannot be trusted by a gradual type system, there is no need to consider only the worst case when optimizing a gradually typed program.  ...  EVALUATION We claim that contract verification of gradually typed programs can eliminate effectively all the overhead of enforcing higher-order soundness.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3434334">doi:10.1145/3434334</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/42yb3qaqf5cetphgdqu2akrzty">fatcat:42yb3qaqf5cetphgdqu2akrzty</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210815203819/https://dl.acm.org/doi/pdf/10.1145/3434334" 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/19/61/1961a3c7b2cff8edb2f1248ffcf2f7c27914020f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3434334"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The Gradual Verifier [chapter]

Stephan Arlt, Cindy Rubio-González, Philipp Rümmer, Martin Schäf, Natarajan Shankar
<span title="">2014</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
To overcome this, we propose a gradual verification approach, GraVy.  ...  Hence, the progress of static verification is hard to measure.  ...  For programs with looping control-flow, abstrac-Algorithm 1: Gradual verification algorithm.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-06200-6_27">doi:10.1007/978-3-319-06200-6_27</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oqnrlf7sdbgtdekwc4retoztve">fatcat:oqnrlf7sdbgtdekwc4retoztve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813174232/http://uu.diva-portal.org/smash/get/diva2:769795/FULLTEXT01.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/14/9f/149f1cc6467f21f602b26a7c0313f35148df280a.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-319-06200-6_27"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Corpse Reviver: Sound and Efficient Gradual Typing via Contract Verification [article]

Cameron Moy and Phúc C. Nguyẽn and Sam Tobin-Hochstadt and David Van Horn
<span title="2020-07-24">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Gradually-typed programming languages permit the incremental addition of static types to untyped programs.  ...  Our key insight is that while untyped code cannot be trusted by a gradual type system, there is no need to consider only the worst case when optimizing a gradually-typed program.  ...  reducing the problem of optimizing a gradually-typed program into the problem of modular contract verification, formalized in a simple gradually-typed calculus, • a tool that implements these ideas, integrating  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.12630v1">arXiv:2007.12630v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n7qoqveskvemjdtonenerramky">fatcat:n7qoqveskvemjdtonenerramky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200806174941/https://arxiv.org/pdf/2007.12630v1.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] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2007.12630v1" 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>

Gradual Verification of Recursive Heap Data Structures

Jenna Wise, Johannes Bader, Cameron Wong, Jonathan Aldrich, Éric Tanter, Joshua Sunshine
<span title="2020-10-14">2020</span> <i title="Zenodo"> Zenodo </i> &nbsp;
The prior approach to gradual verification, however, was limited to programs without recursive data structures.  ...  This paper extends gradual verification to programs that manipulate recursive, mutable data structures on the heap.  ...  program verification.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.4085933">doi:10.5281/zenodo.4085933</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ms3i5evb7napfl6jgucf3um5ka">fatcat:ms3i5evb7napfl6jgucf3um5ka</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201015140252/https://zenodo.org/record/4085933/files/grad-ver-oopsla20-extended.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] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.4085933"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

Gradual Verification of Recursive Heap Data Structures

Jenna Wise, Johannes Bader, Cameron Wong, Jonathan Aldrich, Éric Tanter, Joshua Sunshine
<span title="2020-10-15">2020</span> <i title="Zenodo"> Zenodo </i> &nbsp;
The prior approach to gradual verification, however, was limited to programs without recursive data structures.  ...  This paper extends gradual verification to programs that manipulate recursive, mutable data structures on the heap.  ...  program verification.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.4091690">doi:10.5281/zenodo.4091690</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/np4cjwd3rbhk7guyjvi5wo62xi">fatcat:np4cjwd3rbhk7guyjvi5wo62xi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201020152814/https://zenodo.org/record/4091690/files/grad-ver-oopsla20-extended.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/85/df85fc5a6081da2655676cc9c17f69adf7196e30.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.4091690"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

A Vision for Online Verification-Validation [article]

Matthew A. Hammer, Bor-Yuh Evan Chang, David Van Horn
<span title="2016-08-21">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
To offer verification for this extensible world, we propose online verification-validation (OVV), which consists of language and VM design that enables a "phaseless" approach to program analysis, in contrast  ...  The result of instantiating this gradual type system in an OVV setting is a checker that can progressively type successive continuations of the program until a continuation is fully verified.  ...  The result of instantiating a gradual type system in an online verification-validation setting is a checker that can progressively type successive continuations of the program until a continuation is fully  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.06012v1">arXiv:1608.06012v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mtdhk6ot2ncgpii5anq3afhble">fatcat:mtdhk6ot2ncgpii5anq3afhble</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200827015512/https://arxiv.org/pdf/1608.06012v1.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/8f/5d/8f5d35bab4a5407412920c2e406fc4ffaa10f47b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.06012v1" 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>

A Method to Deduce and Synthesize the Dafny Programs

Changjing WANG, Xilong DING, Jiangfei HE, Xi CHEN, Qing HUANG, Haimei LUO, Zhengkang ZUO
<span title="">2021</span> <i title="EDP Sciences"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/setn5y6whvfaxbomaiseppqm2a" style="color: black;">Wuhan University Journal of Natural Sciences</a> </i> &nbsp;
Furthermore, Dafny program is synthesized through the obtained recursive relationship and loop invariants.  ...  Finally, the functional correctness of Dafny program is automatically verified by Dafny verifier or online tool.  ...  Program transformation was introduced by researchers 50 years ago, and then it was formalized [8] [9] [10] . From then on, program transformation technology has gradually developed.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/wujns/2021266481">doi:10.1051/wujns/2021266481</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4d26gyluqrbgffj5erx6v6uvvq">fatcat:4d26gyluqrbgffj5erx6v6uvvq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220118135814/https://wujns.edpsciences.org/articles/wujns/pdf/2021/06/wujns-1007-1202-2021-06-0481-08.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/6b/18/6b185d462141bd6a7ece7cb8228b92cb8deeca91.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/wujns/2021266481"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

A Verification-Aware Design Methodology for Thread Pipelining Parallelization

Guo-An JIAN, Cheng-An CHIEN, Peng-Sheng CHEN, Jiun-In GUO
<span title="">2012</span> <i title="Institute of Electronics, Information and Communications Engineers (IEICE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xosmgvetnbf4zpplikelekmdqe" style="color: black;">IEICE transactions on information and systems</a> </i> &nbsp;
In contrast to traditional design flow, a behavior-model program is constructed before parallelizing as a bridge to help developers gradually leverage the technique of thread-pipelining parallelization  ...  When verifying the parallel program, the proposed verification approach keeps the performance degradation within 23% and 21.1% in D1 and HD720 resolutions, respectively.  ...  Of note, the verification mechanisms are integrated into the design flow. We leverage a behavior-model program as a bridge for gradually and correctly parallelizing the original program.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.e95.d.2505">doi:10.1587/transinf.e95.d.2505</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zrgue6qzwnbghgojngsai4y32y">fatcat:zrgue6qzwnbghgojngsai4y32y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815123621/https://ir.nctu.edu.tw/bitstream/11536/20444/1/000310397700014.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/70/09/7009b8f7fbbb05e5b6135d93512498ff08ee23a7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1587/transinf.e95.d.2505"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Language-based verification will change the world

Tim Sheard, Aaron Stump, Stephanie Weirich
<span title="">2010</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dj7g645z6zfl5lut4iwy5walyu" style="color: black;">Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER &#39;10</a> </i> &nbsp;
We argue that lightweight, language-based verification is poised to enter mainstream industrial use, where it will have a major impact on software quality and reliability.  ...  We explain how language-based approaches based on so-called dependent types are already being adopted in functional programming languages, and why such methods will be successful for mainstream use, where  ...  We thank other members of the Trellys team for many helpful conversations about dependent types and verified programming.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1882362.1882432">doi:10.1145/1882362.1882432</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigsoft/SheardSW10.html">dblp:conf/sigsoft/SheardSW10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dgwksid6dnfhzkygv5fn3cntzq">fatcat:dgwksid6dnfhzkygv5fn3cntzq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829072224/http://www.seas.upenn.edu/~sweirich/papers/foser10.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/a7/77/a77776a927ea390eac33ce249df0144bd289ef76.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1882362.1882432"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Considering Typestate Verification for Quantified Event Automata [chapter]

Giles Reger
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
It has already been observed that common properties monitored in runtime verification activities take the form of typestate properties.  ...  how the existing static analyses developed for typestate properties may be extended to a more expressive class of properties expressible by a specification formalism originally developed for runtime verification  ...  Gradual Typing There is an area of type theory that deals directly with the notion of mixing static and dynamic analysis: gradual typing [32] is the idea that some parts of the program can be statically  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-47166-2_33">doi:10.1007/978-3-319-47166-2_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lkvxzuv3d5hcbbstxhdxbet5t4">fatcat:lkvxzuv3d5hcbbstxhdxbet5t4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180720064426/https://www.research.manchester.ac.uk/portal/files/56918886/main.5.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/0a/130a0138e16903aede07a91868e551fd5184789d.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-319-47166-2_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Computer-Assisted Program Reasoning Based on a Relational Semantics of Programs

Wolfgang Schreiner
<span title="2012-02-21">2012</span> <i title="Open Publishing Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qzezkwolyvf33pglm2jldjklca" style="color: black;">Electronic Proceedings in Theoretical Computer Science</a> </i> &nbsp;
We present an approach to program reasoning which inserts between a program and its verification conditions an additional layer, the denotation of the program expressed in a declarative form.  ...  The program is first translated into its denotation from which subsequently the verification conditions are generated.  ...  Also the principle of "correct by construction", which emphasizes the gradual refinement of a specification into an executable program such that at any stage of the refinement the program is provably correct  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.79.8">doi:10.4204/eptcs.79.8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s5xelzintbaqxe2lu2de7lr454">fatcat:s5xelzintbaqxe2lu2de7lr454</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808124256/http://www.risc.jku.at/research/formal/software/ProgramExplorer/papers/THeduPaper-2011.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/9c/ee/9cee9a2d52846acb1bc79f753daf803135babe7f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4204/eptcs.79.8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Low Cost Three-Dimensional Programmed Mini-Pump Used in PCR

Chengxiong Lin, Yaocheng Wang, Zhengyu Huang, Yu Guo, Wenming Wu
<span title="2022-05-14">2022</span> <i title="MDPI AG"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4clw6v34prcbvk2usotmbz6v3q" style="color: black;">Micromachines</a> </i> &nbsp;
These results can lay the foundation for the functional, fast, and low-cost programmed mini-pump in PCR or other applications for trace measurements.  ...  Besides, the contrast test between three-dimensional programmed mini-pump and manual pipette was conducted with the ORF1ab and pGEM-3Zf (+) genes in qPCR.  ...  The fluorescence inte of different reaction mixture increases gradually as the reaction proceeds.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/mi13050772">doi:10.3390/mi13050772</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/35630239">pmid:35630239</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wx4bg2jkenfgbohbi2uqij4pay">fatcat:wx4bg2jkenfgbohbi2uqij4pay</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220515233023/https://mdpi-res.com/d_attachment/micromachines/micromachines-13-00772/article_deploy/micromachines-13-00772.pdf?version=1652508180" 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/bc/14/bc148b60a5ecb511fff584e15499bde0d63c8fbe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3390/mi13050772"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> mdpi.com </button> </a>

Challenge proposal

Max Schäfer, Torbjörn Ekman, Oege de Moor
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/et4bvsk4dndlrftj3ooldawbfi" style="color: black;">Proceedings of the 3rd workshop on Programming languages meets program verification - PLPV &#39;09</a> </i> &nbsp;
They are most useful for gradually improving large existing code bases and it is essential that they work reliably, since even a simple refactoring may affect many different parts of a program, and the  ...  We argue that software refactoring tools are a prime candidate for mechanical verification, offering significant challenges but also the prospect of tangible benefits for real-world software development  ...  We believe formalising and verifying refactoring tools is an interesting and novel challenge for language-based program verification.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1481848.1481859">doi:10.1145/1481848.1481859</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/plpv/SchaferEM09.html">dblp:conf/plpv/SchaferEM09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e66bjrk4rjhcnhqzb4dmtznmpi">fatcat:e66bjrk4rjhcnhqzb4dmtznmpi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809122352/http://researcher.watson.ibm.com/researcher/files/us-mschaefer/challenge.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/75/8d/758dede068d2ad9912a8dc978fad0b7731979860.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1481848.1481859"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Partition-based regression verification

Marcel Bohme, Bruno C. D. S. Oliveira, Abhik Roychoudhury
<span title="">2013</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wvv27s77dvd5flktsj246kcxwu" style="color: black;">2013 35th International Conference on Software Engineering (ICSE)</a> </i> &nbsp;
Regression verification (RV) seeks to guarantee the absence of regression errors in a changed program version.  ...  This paper presents Partition-based Regression Verification (PRV): an approach to RV based on the gradual exploration of differential input partitions.  ...  In summary the main contributions of this paper are: • A gradual approach to regression verification that continuously verifies the input space of a program against another version of that program to find  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icse.2013.6606576">doi:10.1109/icse.2013.6606576</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icse/BohmeOR13.html">dblp:conf/icse/BohmeOR13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jp2ac27jfbghvjaws4rqych7xm">fatcat:jp2ac27jfbghvjaws4rqych7xm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151201072019/http://www.comp.nus.edu.sg/~abhik/pdf/ICSE13-PRV.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/5c/52/5c52fe6ae1d026097ba7de5301bf0e322988a836.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icse.2013.6606576"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

More Programming Than Programming: Teaching Formal Methods in a Software Engineering Programme [article]

James Noble, David Streader, Isaac Oscar Gariano, Miniruwani Samarakoon
<span title="2022-05-02">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We redeveloped our software correctness course by taking a programming intensive approach, using the solver-aided language Dafny to provide instant formative feedback via automated assessment.  ...  Following the example of Gradual Dafny [18] and Gradual Verification [3, 5, 48 ] more generally should make testing easier.  ...  Other gradual verification approaches have shown similar promise at partial verification, but with choices embodied in the tools themselves [3, 45, 5, 48] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2205.00787v1">arXiv:2205.00787v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/opqtlvw22naajcvepgeaezyrse">fatcat:opqtlvw22naajcvepgeaezyrse</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220504220442/https://arxiv.org/pdf/2205.00787v1.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/2e/d7/2ed7f6b19638d0a4fd12ffd10a07f9fa57c08dd2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2205.00787v1" 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>
&laquo; Previous Showing results 1 &mdash; 15 out of 93,606 results