Filters








5,784 Hits in 9.8 sec

Simulating reachability using first-order logic with applications to verification of linked data structures

Tal Lev-Ami, Neil Immerman, Thomas Reps, Mooly Sagiv, Siddharth Srivastava, Greta Yorsh, Pierre Wolper
<span title="2009-05-28">2009</span> <i title="Logical Methods in Computer Science e.V."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c67srop7pbe3nciquoxzy3d6pm" style="color: black;">Logical Methods in Computer Science</a> </i> &nbsp;
The main technical contributions are methods for simulating reachability in a conservative way using first-order formulas--the formulas describe a superset of the set of program states that would be specified  ...  This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating  ...  Moreover, the simulation requirements are not necessarily expressible in the decidable logic. Other First-Order Axiomatizations of Linked Data Structures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-5(2:12)2009">doi:10.2168/lmcs-5(2:12)2009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6jnbgs673vah7gvezkz44lf4gq">fatcat:6jnbgs673vah7gvezkz44lf4gq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830012339/http://people.cs.umass.edu/~immerman/pub/cadepaper.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/77/0f/770f4ba44a44152388d9c8b1c8fb4b1eae6d1f67.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2168/lmcs-5(2:12)2009"> <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>

Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures [chapter]

T. Lev-Ami, N. Immerman, T. Reps, M. Sagiv, S. Srivastava, G. Yorsh
<span title="">2005</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 main technical contributions are methods for simulating reachability in a conservative way using first-order formulas-the formulas describe a superset of the set of program states that can actually  ...  This paper shows how to harness existing theorem provers for first-order logic to automatically verify safety properties of imperative programs that perform dynamic storage allocation and destructive updating  ...  Moreover, the simulation requirements are not necessarily expressible in the decidable logic. Other First-Order Axiomatizations of Linked Data Structures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11532231_8">doi:10.1007/11532231_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5bxtjx76ibamhkc6aux5asrvrq">fatcat:5bxtjx76ibamhkc6aux5asrvrq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830012339/http://people.cs.umass.edu/~immerman/pub/cadepaper.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/77/0f/770f4ba44a44152388d9c8b1c8fb4b1eae6d1f67.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11532231_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Verification via Structure Simulation [chapter]

Niel Immerman, Alexander Rabinovich, Thomas W. Reps, Mooly Sagiv, Great Yorsh
<span title="">2004</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;
Decidable logics that can express reachability properties are used to state properties of linked data structures, while guaranteeing that the verification method always terminates.  ...  In this paper, we allow pre-conditions, post-conditions, and loop invariants to be specified in FO(TC): first-order formulas with transitive closure.  ...  Even simple decidable fragments of first-order logic become undecidable when reachability is added [9] . The reader may wonder how undecidable logics can be useful for automatic verification.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-27813-9_22">doi:10.1007/978-3-540-27813-9_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xphcjvwsh5gezajsaooxwxbnm4">fatcat:xphcjvwsh5gezajsaooxwxbnm4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808232547/http://www.cs.tau.ac.il/~msagiv/simulation_cav04_final.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/8b/00/8b00073ad37686f196318b839b7661be19ded7da.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-540-27813-9_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Field Constraint Analysis [chapter]

Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, Martin Rinard
<span title="">2005</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;
Field constraints enable the application of decidable logics to data structures which were originally beyond the scope of these logics, by verifying the backbone of the data structure and then verifying  ...  The generality of our field constraints requires new techniques, which are orthogonal to the traditional use of structure simulation. We present one such technique and prove its soundness.  ...  These sets are defined by using formulas in first-order logic with reflexive transitive closure.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11609773_11">doi:10.1007/11609773_11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/argttkyo4bf7bav4s2ppkjkozi">fatcat:argttkyo4bf7bav4s2ppkjkozi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170818110834/https://infoscience.epfl.ch/record/110237/files/WiesETAL05OnFieldConstraintAnalysis.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/18/58/18587be66bac16f7d5fcbff81b475346a1ca3697.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11609773_11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Survey on Network Verification and Testing with Formal Methods: Approaches and Challenges

Yahui Li, Xia Yin, Zhiliang Wang, Jiangyuan Yao, Xingang Shi, Jianping Wu, Han Zhang, Qing Wang
<span title="">2018</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b4kxurpz5vbn7gog6wq32vliii" style="color: black;">IEEE Communications Surveys and Tutorials</a> </i> &nbsp;
As an area of current interest, it is an interdisciplinary subject (with fields including formal methods, mathematical logic, programming languages, and networks), making it daunting for a nonprofessional  ...  We perform a comprehensive survey on well-developed methodologies and tools for data plane verification, control plane verification, data plane testing and control plane testing.  ...  In contrast, VeriCon [54] uses first-order logic to formulate the network and invariants, and it then proves the correctness of the program.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/comst.2018.2868050">doi:10.1109/comst.2018.2868050</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h3op4heca5d75bpokfsbfevnwe">fatcat:h3op4heca5d75bpokfsbfevnwe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201107140901/https://ieeexplore.ieee.org/ielx7/9739/8649699/08453007.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/38/a5/38a53406576d5fb8df338006f3d381385fc0fc7c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/comst.2018.2868050"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Applying Formal Methods to Networking: Theory, Techniques, and Applications

Junaid Qadir, Osman Hasan
<span title="">2015</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b4kxurpz5vbn7gog6wq32vliii" style="color: black;">IEEE Communications Surveys and Tutorials</a> </i> &nbsp;
This has also led to a great resurgence in interest of applying formal methods to specification, verification, and synthesis of networking protocols and applications.  ...  In this paper, we present a self-contained tutorial of the formidable amount of work that has been done in formal methods, and present a survey of its applications to networking.  ...  While predicate logic subsumes first-order logic, second-order logic, or infinitary logic, etc., the unqualified use of predicate logic typically refers to first-order logic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/comst.2014.2345792">doi:10.1109/comst.2014.2345792</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oc6l6pn4tnddjbbr5v4gbbuycq">fatcat:oc6l6pn4tnddjbbr5v4gbbuycq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160328123237/http://www.comsoc.org:80/files/Publications/Tech%20Focus/2016/network-infrastructure/3.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/9b/89/9b89d393af3de22f0fa659d934216b2d2645ff34.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/comst.2014.2345792"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Full functional verification of linked data structures

Karen Zee, Viktor Kuncak, Martin Rinard
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jpubwsjaozha5itdes6pzyz2fm" style="color: black;">Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI &#39;08</a> </i> &nbsp;
Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data  ...  We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables.  ...  We thank Charles Bouillaguet for developing the interface to first-order provers [14] . We also thank the anonymous reviewers and our shepherd, Rajeev Alur, for their useful feedback on the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1375581.1375624">doi:10.1145/1375581.1375624</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pldi/ZeeKR08.html">dblp:conf/pldi/ZeeKR08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xdwn3c6bdvgpvkzakt44gj7iu4">fatcat:xdwn3c6bdvgpvkzakt44gj7iu4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130514095750/http://people.csail.mit.edu/rinard/paper/pldi08.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/da/74/da7419bcef934f9c7d1bcc86d21f14fc11cd3e5d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1375581.1375624"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Full functional verification of linked data structures

Karen Zee, Viktor Kuncak, Martin Rinard
<span title="2008-05-30">2008</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;
Specifically, we present the use of the Jahob verification system to verify formal specifications, written in classical higher-order logic, that completely capture the desired behavior of the Java data  ...  We present the first verification of full functional correctness for a range of linked data structure implementations, including mutable lists, trees, graphs, and hash tables.  ...  We thank Charles Bouillaguet for developing the interface to first-order provers [14] . We also thank the anonymous reviewers and our shepherd, Rajeev Alur, for their useful feedback on the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1379022.1375624">doi:10.1145/1379022.1375624</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lblfpn5a5nh6jm276xlgbzxp24">fatcat:lblfpn5a5nh6jm276xlgbzxp24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130514095750/http://people.csail.mit.edu/rinard/paper/pldi08.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/da/74/da7419bcef934f9c7d1bcc86d21f14fc11cd3e5d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1379022.1375624"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Verification of Computer Switching Networks: An Overview [chapter]

Shuyuan Zhang, Sharad Malik, Rick McGeer
<span title="">2012</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;
Formal verification has seen much success in several domains of hardware and software design.  ...  symbolic simulation, model checking, and propositional logic verification using SAT.  ...  As a result, in practice the FSM and combinational logic based approaches will wind up doing the same calculation over mathematically-equivalent objects; all that differs is the data structures used to  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-33386-6_1">doi:10.1007/978-3-642-33386-6_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jyp4ytxq4ralnafeq7yj4h2n64">fatcat:jyp4ytxq4ralnafeq7yj4h2n64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190308102028/http://pdfs.semanticscholar.org/f145/15b34e95434fe4dc5fd1e80d63d7f8cc8f51.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/f1/45/f14515b34e95434fe4dc5fd1e80d63d7f8cc8f51.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-33386-6_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Comparative Assessment of Collaborative Business Process Verification Approaches [chapter]

John Paul Kasse, Lai Xu, Paul de Vrieze
<span title="">2017</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/kss7mrolvja63k4rmix3iynkzi" style="color: black;">IFIP Advances in Information and Communication Technology</a> </i> &nbsp;
We also look at how big data impacts the business process verification approach in a data-rich world.  ...  Research in business process model verification has yielded a plethora of approaches in form of languages and tools that are based on Petri nets family and temporal logic.  ...  Besides, best practice linking verification approaches to vF cBPs is missing. The EU H2020 FIRST project aims to develop a method to support non expert end users to model and verify vF cBPs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-65151-4_33">doi:10.1007/978-3-319-65151-4_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gzqlcqiswjhd5plfbl5w7hzyeq">fatcat:gzqlcqiswjhd5plfbl5w7hzyeq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721054441/http://eprints.bournemouth.ac.uk/29340/1/PRO-VE%202017_paper%206.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/1d/02/1d021b4b8ae4f0128773dc0f00b0556d704b9e98.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-65151-4_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Poling: SMT Aided Linearizability Proofs [chapter]

He Zhu, Gustavo Petri, Suresh Jagannathan
<span title="">2015</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;
Proofs of linearizability of concurrent data structures generally rely on identifying linearization points to establish a simulation argument between the implementation and the specification.  ...  However, for many linearizable data structure operations, the linearization points may not correspond to their internal static code locations; for example, they might reside in the code of another concurrent  ...  Poling abstracts concurrent data structure into sets of locations following [17] and considers linearizability verification as a property checking technique, which are efficiently solved with an SMT  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-21668-3_1">doi:10.1007/978-3-319-21668-3_1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ihiqi6xjffhnzdaaov2kl6gt24">fatcat:ihiqi6xjffhnzdaaov2kl6gt24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830002651/https://www.cs.purdue.edu/homes/zhu103/pubs/cav15.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/9e/29/9e2979a681fd9ddc4b270566f7abc6c25c43dcf8.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-21668-3_1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Two approaches linking a test generation tool with verification techniques [chapter]

Marylène Clatin, Roland Groz, Marc Phalippou, Richard Thummel
<span title="">1996</span> <i title="Springer US"> Protocol Test Systems VIII </i> &nbsp;
The first method is a kind of symbolic execution. The second method consists in linking the test generation tool with a tool permitting sophisticated types of reachability analysis.  ...  This paper presents two methods implemented in a test generation tool to compute significant feasible test paths including parameter values for input-output events.  ...  Reachability technique Another way of computing transition chains consists in using a simulator. In our case, we have coupled TVEDA with Veda.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-34988-6_10">doi:10.1007/978-0-387-34988-6_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jdpbuufisvg4zhgjisruv56rom">fatcat:jdpbuufisvg4zhgjisruv56rom</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180729205631/https://link.springer.com/content/pdf/10.1007%2F978-0-387-34988-6_10.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/9a/e6/9ae6dd7ff1fbdca10cec2c139eb9d99187d3b9c4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-34988-6_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Providing Automated Verification in HOL Using MDGs [chapter]

Tarek Mhamdi, Sofiène Tahar
<span title="">2004</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 deeply embedded the MDG underlying logic in HOL and implemented a platform that provides a set of algorithms allowing the user to develop his/her own state-exploration based application inside HOL.  ...  We have been able to implement and experiment with different state exploration techniques within HOL such as MDG reachability analysis, equivalence and model checking.  ...  Once available inside the theorem prover, the MDG data structure and operators can be used to automate parts of the verification problem or even to write state enumeration algorithms like reachability  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-30476-0_24">doi:10.1007/978-3-540-30476-0_24</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hdnnll3ldfd6vipdvgazdffd4a">fatcat:hdnnll3ldfd6vipdvgazdffd4a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706030624/http://hvg.ece.concordia.ca/Publications/Conferences/35_ATVA%2704.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/d2/31/d2316189bd28a58f2f16ef0b529c3a544356e8b1.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-540-30476-0_24"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Effectively-Propositional Reasoning about Reachability in Linked Data Structures [chapter]

Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv
<span title="">2013</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;
This paper proposes a novel method of harnessing existing SAT solvers to verify reachability properties of programs that manipulate linked-list data structures.  ...  We implemented a tool atop Z3 and used it to show the correctness of several linked list programs.  ...  ), except that our solution is geared towards verification of heap-manipulating programs with linked data structures.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-39799-8_53">doi:10.1007/978-3-642-39799-8_53</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ltfnbbpqojhmdl5keahlc762py">fatcat:ltfnbbpqojhmdl5keahlc762py</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810114312/http://software.imdea.org/~ab/Publications/cav2013tr.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/97/9d97a433b3b5d1e0dab04a9d1031f6cd2255c841.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-39799-8_53"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

AVR: Abstractly Verifying Reachability [chapter]

Aman Goel, Karem Sakallah
<span title="">2020</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;
Moreover, proof certificates can be further used in innovative ways to extract key design information and are useful in a growing number of applications.  ...  with a word-level implementation of the IC3 algorithm.  ...  It uses syntax-guided abstraction [34] , a generalization of implicit predicate abstraction [22] , to perform IC3-style reachability on a first-order logic encoding of the transition relation resulting  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-030-45190-5_23">doi:10.1007/978-3-030-45190-5_23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xk7elqf3zbcfdgftw7qedb4dtu">fatcat:xk7elqf3zbcfdgftw7qedb4dtu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200510113609/https://link.springer.com/content/pdf/10.1007%2F978-3-030-45190-5_23.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/1e/f3/1ef39045bb300e2327ba589e21d7e705498e5c2b.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-030-45190-5_23"> <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,784 results