{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T05:06:20Z","timestamp":1720760780166},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Logical and Algebraic Methods in Programming"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1016\/j.jlamp.2017.09.002","type":"journal-article","created":{"date-parts":[[2017,9,22]],"date-time":"2017-09-22T04:46:56Z","timestamp":1506055616000},"page":"68-91","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Executing and verifying higher-order functional-imperative programs in Maude"],"prefix":"10.1016","volume":"93","author":[{"given":"Vlad","family":"Rusu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Arusoaie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jlamp.2017.09.002_br0010","series-title":"All About Maude\u2014A High-Performance Logical Framework: How to Specify, Program and Verify Systems in Rewriting Logic","author":"Clavel","year":"2007"},{"key":"10.1016\/j.jlamp.2017.09.002_br0030","series-title":"Proceedings of the 39th International Colloquium on Automata, Languages and Programming","first-page":"351","article-title":"Towards a unified theory of operational and axiomatic semantics","volume":"vol. 7392","author":"Ro\u015fu","year":"2012"},{"key":"10.1016\/j.jlamp.2017.09.002_br0040","series-title":"Proceedings of the 27th Conference on Object-Oriented Programming, Systems, Languages, and Applications","first-page":"555","article-title":"Checking reachability using matching logic","author":"Ro\u015fu","year":"2012"},{"key":"10.1016\/j.jlamp.2017.09.002_br0050","series-title":"Proceedings of the 28th Symposium on Logic in Computer Science","first-page":"358","article-title":"One-path reachability logic","author":"Ro\u015fu","year":"2013"},{"key":"10.1016\/j.jlamp.2017.09.002_br0060","series-title":"Proceedings of the Joint 25th International Conference on Rewriting Techniques and Applications and 12th International Conference on Typed Lambda Calculi and Applications","first-page":"425","article-title":"All-path reachability logic","volume":"vol. 8560","author":"\u015etef\u0103nescu","year":"2014"},{"key":"10.1016\/j.jlamp.2017.09.002_br0080","series-title":"Theorem Proving in Higher Order Logics, Proceedings of the 22nd International Conference","first-page":"440","article-title":"A Hoare logic for the state monad","volume":"vol. 5674","author":"Swierstra","year":"2009"},{"key":"10.1016\/j.jlamp.2017.09.002_br0090","series-title":"Proceedings of the 31th Conference on Object-Oriented Programming, Systems, Languages, and Applications","article-title":"Semantics-based program verifiers for all languages","author":"\u015etef\u0103nescu","year":"2016"},{"key":"10.1016\/j.jlamp.2017.09.002_br0110","author":"Lucanu"},{"issue":"1","key":"10.1016\/j.jlamp.2017.09.002_br0120","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.jlamp.2015.09.001","article-title":"Language definitions as rewrite theories","volume":"85","author":"Rusu","year":"2016","journal-title":"J. Log. Algebraic Methods Program."},{"issue":"3","key":"10.1016\/j.jlamp.2017.09.002_br0130","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00165-016-0361-7","article-title":"A language-independent proof system for full program equivalence","volume":"28","author":"Ciob\u00e2c\u0103","year":"2016","journal-title":"Form. Asp. Comput."},{"key":"10.1016\/j.jlamp.2017.09.002_br0140","first-page":"48","article-title":"Symbolic execution based on language transformation","volume":"44","author":"Arusoaie","year":"2015","journal-title":"Comput. Lang. Syst. Struct."},{"issue":"4","key":"10.1016\/j.jlamp.2017.09.002_br0150","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1007\/s00165-014-0319-6","article-title":"Program equivalence by circular reasoning","volume":"27","author":"Lucanu","year":"2015","journal-title":"Form. Asp. Comput."},{"issue":"7","key":"10.1016\/j.jlamp.2017.09.002_br0160","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","article-title":"Symbolic execution and program testing","volume":"19","author":"King","year":"1976","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jlamp.2017.09.002_br0170","series-title":"International Conference on Automated Software Engineering","first-page":"179","article-title":"Symbolic PathFinder: symbolic execution of Java bytecode","author":"P\u0103s\u0103reanu","year":"2010"},{"key":"10.1016\/j.jlamp.2017.09.002_br0180","series-title":"Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation","first-page":"213","article-title":"DART: directed automated random testing","author":"Godefroid","year":"2005"},{"key":"10.1016\/j.jlamp.2017.09.002_br0190","series-title":"Proceedings of the 10th European Software Engineering Conference Held Jointly with 13th ACM SIGSOFT International Symposium on Foundations of Software Engineering","first-page":"263","article-title":"CUTE: a concolic unit testing engine for C","author":"Sen","year":"2005"},{"key":"10.1016\/j.jlamp.2017.09.002_br0200","series-title":"ACM Conference on Computer and Communications Security","first-page":"322","article-title":"EXE: automatically generating inputs of death","author":"Cadar","year":"2006"},{"key":"10.1016\/j.jlamp.2017.09.002_br0210","series-title":"Tests and Proofs, Second International Conference","first-page":"171","article-title":"Parameterized unit testing with Pex","volume":"vol. 4966","author":"de Halleux","year":"2008"},{"key":"10.1016\/j.jlamp.2017.09.002_br0220","series-title":"Proc. 8th USENIX Conference on Operating Systems Design and Implementation","first-page":"209","article-title":"Klee: unassisted and automatic generation of high-coverage tests for complex systems programs","author":"Cadar","year":"2008"},{"issue":"5","key":"10.1016\/j.jlamp.2017.09.002_br0230","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/503271.503230","article-title":"Using symbolic execution for verifying safety-critical systems","volume":"26","author":"Coen-Porisini","year":"2001","journal-title":"Softw. Eng. Notes"},{"key":"10.1016\/j.jlamp.2017.09.002_br0240","series-title":"Computer Aided Verification\u2014Proceedings of the 24th International Conference","first-page":"758","article-title":"TRACER: a symbolic execution tool for verification","volume":"vol. 7358","author":"Jaffar","year":"2012"},{"key":"10.1016\/j.jlamp.2017.09.002_br0250","series-title":"Proceedings of the 23rd international conference on Computer aided verification","first-page":"669","article-title":"Practical, low-effort equivalence verification of real code","author":"Ramos","year":"2011"},{"issue":"7","key":"10.1016\/j.jlamp.2017.09.002_br0260","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1538788.1538814","article-title":"Formal verification of a realistic compiler","volume":"52","author":"Leroy","year":"2009","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jlamp.2017.09.002_br0270","series-title":"PLDI","first-page":"83","article-title":"Translation validation for an optimizing compiler","author":"Necula","year":"2000"},{"key":"10.1016\/j.jlamp.2017.09.002_br0280","series-title":"Applied Semantics, International Summer School","first-page":"378","article-title":"Operational semantics and program equivalence","author":"Pitts","year":"2002"},{"key":"10.1016\/j.jlamp.2017.09.002_br0290","series-title":"CAV","first-page":"185","article-title":"Formal verification of backward compatibility of microcode","volume":"vol. 3576","author":"Arons","year":"2005"},{"key":"10.1016\/j.jlamp.2017.09.002_br0300","series-title":"ICLP","first-page":"287","article-title":"Proving the equivalence of CLP programs","volume":"vol. 2401","author":"Craciunescu","year":"2002"},{"key":"10.1016\/j.jlamp.2017.09.002_br0310","series-title":"CAV","first-page":"63","article-title":"Regression verification: proving the equivalence of similar programs","volume":"vol. 5643","author":"Strichman","year":"2009"},{"key":"10.1016\/j.jlamp.2017.09.002_br0320","series-title":"Essays in Memory of Amir Pnueli","first-page":"167","article-title":"Inference rules for proving the equivalence of recursive procedures","volume":"vol. 6200","author":"Godlin","year":"2010"},{"key":"10.1016\/j.jlamp.2017.09.002_br0330","series-title":"24th International Conference on Rewriting Techniques and Applications","first-page":"81","article-title":"Abstract logical model checking of infinite-state systems using narrowing","volume":"vol. 21","author":"Bae","year":"2013"},{"key":"10.1016\/j.jlamp.2017.09.002_br0340","series-title":"Rewriting Logic and Its Applications \u2013 10th International Workshop, WRLA 2014, Held as a Satellite Event of ETAPS, Grenoble, France, April 5\u20136, 2014","article-title":"Rewriting modulo SMT and open system analysis","author":"Rocha","year":"2014"},{"key":"10.1016\/j.jlamp.2017.09.002_br0350","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.jlamp.2016.10.001","article-title":"Rewriting modulo {SMT} and open system analysis","volume":"86","author":"Rocha","year":"2017","journal-title":"J. Log. Algebraic Methods Program."},{"key":"10.1016\/j.jlamp.2017.09.002_br0360","series-title":"6th International Conference on Software Language Engineering","first-page":"281","article-title":"A generic framework for symbolic execution","volume":"vol. 8225","author":"Arusoaie","year":"2013"},{"key":"10.1016\/j.jlamp.2017.09.002_br0370","series-title":"Rewriting Logic and Its Applications \u2013 11th International Workshop, WRLA 2016, Held as a Satellite Event of ETAPS, Eindhoven, The Netherlands, April 2\u20133, 2016, Revised Selected Papers","first-page":"134","article-title":"Proving reachability-logic formulas incrementally","volume":"vol. 9942","author":"Rusu","year":"2016"},{"key":"10.1016\/j.jlamp.2017.09.002_br0380","series-title":"Proceedings of the 13th International Conference on Algebraic Methodology and Software Technology","first-page":"142","article-title":"Matching logic: an alternative to Hoare\/Floyd logic","volume":"vol. 6486","author":"Ro\u015fu","year":"2010"},{"key":"10.1016\/j.jlamp.2017.09.002_br0390","series-title":"ICSE'11: Proceedings of the 30th International Conference on Software Engineering","first-page":"868","article-title":"Matching logic: a new program verification approach (NIER track)","author":"Ro\u015fu","year":"2011"},{"key":"10.1016\/j.jlamp.2017.09.002_br0400","series-title":"Proceedings of the 26th International Conference on Rewriting Techniques and Applications","first-page":"5","article-title":"Matching logic \u2014 extended abstract","volume":"vol. 36","author":"Ro\u015fu","year":"2015"}],"container-title":["Journal of Logical and Algebraic Methods in Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220816301390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352220816301390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,12,4]],"date-time":"2021-12-04T08:53:20Z","timestamp":1638608000000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352220816301390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":37,"alternative-id":["S2352220816301390"],"URL":"https:\/\/doi.org\/10.1016\/j.jlamp.2017.09.002","relation":{},"ISSN":["2352-2208"],"issn-type":[{"value":"2352-2208","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Executing and verifying higher-order functional-imperative programs in Maude","name":"articletitle","label":"Article Title"},{"value":"Journal of Logical and Algebraic Methods in Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jlamp.2017.09.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}