{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/reluplex-an-efficient-smt-solver-for","title":"Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks","arxiv_id":"1702.01135","date":"2017-02-03","proceeding":null,"authors":["Guy Katz","Clark Barrett","David Dill","Kyle Julian","Mykel Kochenderfer"],"abstract":"Deep neural networks have emerged as a widely used and effective means for\ntackling complex, real-world problems. However, a major obstacle in applying\nthem to safety-critical systems is the great difficulty in providing formal\nguarantees about their behavior. We present a novel, scalable, and efficient\ntechnique for verifying properties of deep neural networks (or providing\ncounter-examples). The technique is based on the simplex method, extended to\nhandle the non-convex Rectified Linear Unit (ReLU) activation function, which\nis a crucial ingredient in many modern neural networks. The verification\nprocedure tackles neural networks as a whole, without making any simplifying\nassumptions. We evaluated our technique on a prototype deep neural network\nimplementation of the next-generation airborne collision avoidance system for\nunmanned aircraft (ACAS Xu). Results show that our technique can successfully\nprove properties of networks that are an order of magnitude larger than the\nlargest networks verified using existing methods.","url_abs":"http://arxiv.org/abs/1702.01135v2","url_pdf":"http://arxiv.org/pdf/1702.01135v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/guykatzz/ReluplexCav2017","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/Lzsxx/Leaky-Reluplex","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/eth-sri/eran","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/hypro/hypro","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/pauls658/ReluDiff-ICSE2020-Artifact","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/rm2pt/veriprune","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/sen-uni-kn/specrepair","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/stanleybak/nnenum","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"reluplex-an-efficient-smt-solver-for","repo_url":"https://github.com/vehicle-lang/vehicle","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"collision-avoidance","task_name":"Collision Avoidance"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.01135","atlas_url":"https://app.syntology.ai/?focus=1702.01135","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1702.01135"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.01135\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.01135"},"call":"get_concepts_for_paper(arxiv_id=\"1702.01135\")"}],"by_repo":[{"repo":"guykatzz/ReluplexCav2017","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Lzsxx/Leaky-Reluplex","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"eth-sri/eran","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2103.06624"],"harvested_for_calls":[{"arxiv_id":"2103.06624","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.06624"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.06624\")"}]},{"repo":"hypro/hypro","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"pauls658/ReluDiff-ICSE2020-Artifact","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1804.10829"],"harvested_for_calls":[{"arxiv_id":"1804.10829","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1804.10829"},"call":"get_harvested_code_for_paper(arxiv_id=\"1804.10829\")"}]},{"repo":"rm2pt/veriprune","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1804.10829"],"harvested_for_calls":[{"arxiv_id":"1804.10829","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1804.10829"},"call":"get_harvested_code_for_paper(arxiv_id=\"1804.10829\")"}]},{"repo":"sen-uni-kn/specrepair","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2301.11342"],"harvested_for_calls":[{"arxiv_id":"2301.11342","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2301.11342"},"call":"get_harvested_code_for_paper(arxiv_id=\"2301.11342\")"}]},{"repo":"stanleybak/nnenum","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"vehicle-lang/vehicle","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"04eec2e870bcc0d5e3d1c20c9a326591c4904c9cccdb826167078778186b206f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}