{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:56:33Z","timestamp":1771030593837,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.23919\/fmcad.2017.8102241","type":"proceedings-article","created":{"date-parts":[[2017,11,9]],"date-time":"2017-11-09T21:49:00Z","timestamp":1510264140000},"page":"55-59","source":"Crossref","is-referenced-by-count":77,"title":["Z3str3: A String Solver with Theory-aware Heuristics"],"prefix":"10.23919","author":[{"given":"Murphy","family":"Berzish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijay","family":"Ganesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunhui","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21668-3_2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572286"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_43"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2016.7886670"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2389836.2389853"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.38"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.3233\/SAT190034","article-title":"Lazy satisfiability modulo theories","volume":"3","author":"sebastiani","year":"2007","journal-title":"Journal on Satisfiability Boolean Modeling and Computation"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491447"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2522920.2522926"},{"key":"ref4","first-page":"255","author":"aydin","year":"2015","journal-title":"Automata-Based Model Counting for String Constraints"},{"key":"ref3","first-page":"97","author":"ab\u00edo","year":"2013","journal-title":"To Encode or to Propagate? The Best Choice for Each Constraint in SAT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_27"},{"key":"ref5","first-page":"108","author":"bailleux","year":"2003","journal-title":"Efficient CNF Encoding of Boolean Cardinality Constraints"},{"key":"ref8","first-page":"737","author":"dutertre","year":"2014","journal-title":"Computer-Aided Verification (CAV'2014) volume 8559 of Lecture Notes in Computer Science"},{"key":"ref7","first-page":"337","article-title":"Z3: an efficient SMT solver","author":"de moura","year":"2008","journal-title":"Proceedings of the Theory and practice of software 14th international conference on Tools and algorithms for the construction and analysis of systems TACAS'08"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_10"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1273463.1273484"},{"key":"ref1","year":"0","journal-title":"IBM Security AppScan Tool and Source"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660372"},{"key":"ref22","first-page":"32","author":"wassermann","year":"2007","journal-title":"Sound and precise analysis of web applications for injection vulnerabilities"},{"key":"ref21","first-page":"218","author":"trinh","year":"2016","journal-title":"Progressive Reasoning over Recursively-Defined Strings"},{"key":"ref24","first-page":"235","author":"zheng","year":"2015","journal-title":"Effective Search-Space Pruning for Solvers of String Equations Regular Expressions and Length Constraints"},{"key":"ref23","first-page":"1","article-title":"Z3str2: an efficient solver for strings, regular expressions, and length constraints","author":"zheng","year":"2016","journal-title":"Formal Methods in System Design"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491456"}],"event":{"name":"2017 Formal Methods in Computer-Aided Design (FMCAD)","location":"Vienna","start":{"date-parts":[[2017,10,2]]},"end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 Formal Methods in Computer Aided Design (FMCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8093672\/8102222\/08102241.pdf?arnumber=8102241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T13:53:08Z","timestamp":1603288388000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8102241\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":25,"URL":"https:\/\/doi.org\/10.23919\/fmcad.2017.8102241","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}