Automated reasoning's scientific frontiers

{"value":"Automated reasoning is the algorithmic search through the infinite set of theorems in mathematical logic. We can use automated reasoning to answer questions about what systems such as biological models and computer programs can and cannot do in the wild.\n\nIn the 1990s, AMD, IBM, Intel, and other companies invested in automated reasoning for circuit and microprocessor design, leading to today’s widely used and industry-standard hardware formal-verification tools (e.g., ++[JasperGold](https://www.cadence.com/en_US/home/tools/system-design-and-verification/formal-and-static-verification/jasper-gold-verification-platform.html)++). In the 2000s, automated reasoning expanded to niche software domains such as device drivers (e.g., ++[Static Driver Verifier](https://docs.microsoft.com/en-us/windows-hardware/drivers/devtest/static-driver-verifier)++) or transportation systems (e.g., ++[Prover technology](https://www.prover.com/)++). In the 2010s, we saw automated reasoning increasingly applied to our foundational computing infrastructure, such as cryptography, networking, storage, and virtualization.\n\nWith recently launched cloud services such as ++[IAM Access Analyzer](https://docs.aws.amazon.com/IAM/latest/UserGuide/what-is-access-analyzer.html)++ and ++[VPC Network Access Analyzer](https://docs.aws.amazon.com/vpc/latest/network-access-analyzer/what-is-vaa.html)++, automated reasoning is now beginning to change how computer systems built on top of the cloud are developed and operated.\n\nAll these applications of automated reasoning rest on a common foundation: automated and semi-automated mechanical theorem provers. ++[ACL2](https://github.com/acl2/acl2)++, ++[CVC5](https://cvc5.github.io/)++, ++[HOL-light’s Meson_tac](https://github.com/jrh13/hol-light)++, ++[MiniSat](http://minisat.se/)++, and ++[Vampire](https://github.com/vprover/)++ are a few examples, but there are many more we could name. They are all, in outline, working on the same problem: the search for proofs in mathematical logic.\n\nOver the past 30 years, slowly but surely, a ++[virtuous cycle](https://www.youtube.com/watch?v=3kM2hFNZAio)++ has formed: automated reasoning in specific and critical application areas drives more investment in foundational tools, while improvements in the foundational tools drive further applications. Around and around.\n\n\n\nThe propositional-satisfiability problem (a.k.a. SAT) is NP-complete, and in the case of unstructured decision graphs (left), the problem instances can be prohibitively time consuming to solve. But when the decision graphs have some inherent structure (right), automatic solvers can exploit that structure to find solutions efficiently.\nVISUALIZATIONS PRODUCED BY CARSTEN SINZ, USING HIS ++[3DVIS](https://github.com/msoos/3dVis)++ VISUALIZATION TOOL\n\nThe increasingly difficult benchmarks driving the development of these tools present new science opportunities. International competitions such as ++[CASC](http://www.tptp.org/CASC/)++, ++[SAT-COMP](http://www.satcompetition.org/)++, ++[SMT-COMP](https://smt-comp.github.io/2021/)++, ++[SV-COMP](https://sv-comp.sosy-lab.org/2021/)++, and the ++[Termination competition](http://termination-portal.org/wiki/Termination_Competition)++ have accelerated this virtuous cycle. On the application side, with increasing power from the tools come new research opportunities in the design of customer-intuitive tools (such as models of ++[cellular signaling pathways](https://biomodelanalyzer.org/)++ or Amazon's ++[abstraction of control policies](https://www.amazon.science/publications/stratified-abstraction-of-access-control-policies)++ for cloud computing).\n\nAs an example of the virtuous cycle at work, consider the following graph, which shows the results for all of the winners of ++[SAT-COMP](http://www.satcompetition.org/)++ from 2002 to 2021, compared apples-to-apples in a competition with the same hardware and same benchmarks:\n\n\n\nThis graph plots the number of benchmarks that each solver can solve in 200 seconds, 400 seconds, etc. The higher the line, the more benchmarks the solver could solve. By looking at the plot we can see, for example, that the 2010 winner (++[cryptominisat](https://github.com/msoos/cryptominisat)++) solved approximately 50 benchmarks within the allotted 1,000 seconds, whereas the 2021 winner (++[kissat](http://fmv.jku.at/kissat/)++) can solve nearly four times as many benchmarks in the same time, using the same hardware. Why did the tools get better? Because members of the scientific community pushing on the application submitted benchmarks to the competitions, which helped tool developers take the tools to new heights of performance and scale.\n\nAt Amazon we see the velocity of the virtuous cycle dramatically increasing. Our automated-reasoning tools are now called billions of times daily, with growth rates exceeding 100% year-over-year. For example, Amazon Web Services customers now have access to automated-reasoning-based features such as ++[IAM Access Analyzer](https://docs.aws.amazon.com/IAM/latest/UserGuide/what-is-access-analyzer.html)++, ++[S3 Block Public Access](https://aws.amazon.com/s3/features/block-public-access/)++, or ++[VPC Reachability Analyzer](https://docs.aws.amazon.com/vpc/latest/reachability/what-is-reachability-analyzer.html)++. We also see Amazon development teams using tools such as ++[Dafny](https://github.com/dafny-lang/dafny)++, ++[P](https://github.com/p-org/P)++, and ++[SAW](https://saw.galois.com/)++.\n\nWhat’s most exciting to me as an automated-reasoning scientist is that our research area seems to be entering a golden era. I think we are beginning to witness a transformation in automated reasoning that is similar to what happened in virtualized computing as the cloud’s virtuous cycle spun up. As described in ++[Werner Vogels’s 2019 re:Invent keynote](https://www.youtube.com/watch?v=OdzaTbaQwTg)++, Amazon Web Services’s ++[EC2](https://aws.amazon.com/ec2/nitro/)++ team was driven by unprecedented customer adoption to reinvent its hypervisor, microprocessor, and networking stack, capturing significant improvements in security, cost, and team agility made possible by economies of scale.\n\nThere are parallels in automated reasoning today. Dramatic new infrastructure is needed for viable business reasons, putting a spotlight on research questions that were previously obscure and unsolved. Below I outline three examples of open research areas driven by the increasing scale of automated-reasoning tools and our underlying computing infrastructure.\n\n#### **Example: Distributed proof search**\n\nFor over two decades the automated-reasoning scientific community has postulated that distributed-systems-based proof search could be faster than sequential proof search. But we didn’t have the economic scale to justify serious investigation of the question.\n\nAt Amazon, with our increased reliance on automated reasoning, we now have that kind of scale. For example, we sponsored the new cloud-based-tool tracks in several international competitions.\n\nCompare the ++[mallob-mono](https://github.com/domschrei/mallob)++ solver, the winner of SAT-COMP’s new cloud-solver track, to the single-microprocessor solvers:\n\n\n\nMallob-mono is now, by a wide margin, the most powerful SAT solver on the planet. And like the sequential solvers, the distributed solvers are improving.\n\nAs described in Kuhn’s seminal book ++[<i>The Structure of Scientific Revolutions</i>](https://en.wikipedia.org/wiki/The_Structure_of_Scientific_Revolutions)++, major perspective shifts like this tend to trigger scientific revolutions. The success of distributed proof search raises the possibility of similar revolutions. For example, we may need to re-evaluate our assumptions about when to use ++[eager vs. lazy reduction techniques](https://en.wikipedia.org/wiki/Evaluation_strategy)++ when converting between formalisms.\n\nHere at Amazon, we recently reconsidered the PhD dissertation of University of California, Berkeley, professor ++[Sanjit Seshia](http://people.eecs.berkeley.edu/~sseshia/)++ in light of mallob-mono and were able to quickly (in about 2,000 lines of Rust) develop a new eager-reduction-based solver that outperforms today’s leading lazy-reduction tools on the notoriously difficult SMT-COMP bcnscheduling and job_shop benchmarks. Here we are solving SAT problems that go beyond Booleans, to involve integers, real numbers, strings, or functions. We call this SAT modulo theories, or SMT.\n\nIn the graph below we compare the performance of leading lazy SMT solvers ++[CVC5](https://cvc5.github.io/)++ and ++[Z3](https://github.com/Z3Prover/z3)++ to a Seshia-style eager solver based on the SAT solvers Kissat and mallob-mono on those benchmarks:\n\n\n\nWe’ve published the code for ++[our Seshia-style eager solver](https://github.com/awslabs/rust-smt-ir)++ on GitHub.\n\nThere are many other open questions driven by distributed proof search. For example, is there an effective lookahead-solver strategy for ++[SMT](https://en.wikipedia.org/wiki/Satisfiability_modulo_theories)++ that would facilitate ++[cube-and-conquer](https://github.com/marijnheule/CnC)++? Or as the ++[Zoncolan](https://engineering.fb.com/2019/08/15/security/zoncolan/)++ service does when analyzing programs for security vulnerabilities, can we memoize intermediate lemmas in a cloud database and reuse them, rather than recomputing for each query? Can ++[Monte Carlo tree search](https://en.wikipedia.org/wiki/Monte_Carlo_tree_search)++ in the cloud on past proofs be used to synthesize more-effective proof search strategies?\n\n#### **Another example: Reasoning about distributed systems**\n\nRecent examples of formal reasoning within Amazon Web Services at the level of distributed-protocol design include a proof of S3’s recently announced ++[strong consistency](https://aws.amazon.com/s3/consistency/)++ and the ++[protocol-level proof of secrecy in Amazon Web Services's KMS service](https://dl.acm.org/doi/10.1145/3319535.3354228)++. The problem with these proofs is that they apply to the protocols that power the distributed services, not necessarily to the code running on the servers that use those protocols.\n\nHere at Amazon, we believe that automated reasoning at the level of protocol design has the greatest long-term value when the investment cost is amortized and protected via continuous integration/continuous delivery (CI/CD) integrations with the code that implements the protocols. That is, the benefit of upfront effort is often seen later, when protocol compliance proofs fail on buggy changes to implementation source code. The code doesn’t make it to production until the developers have fixed it.\n\nAgain: major perspective shifts like those resulting from successful proofs about S3 and KMS could trigger a revolution, à la ++[Kuhn](https://en.wikipedia.org/wiki/The_Structure_of_Scientific_Revolutions)++. For years, we have had tools for reasoning about distributed systems, such as TLA+ and P. But with the success of the work with S3 and KMS, it’s now clear that protocol design should be a first-class concept for engineering, with tools that support it, proactively finding errors and proving properties.\n\nThese tools should also connect to the source code that speaks the protocols by (i) constructing specifications that can be proved with existing code-level tools and (ii) synthesizing implementation code in languages such as C, Go, Rust, or Java. The tools would facilitate integration into our CI/CD, code review, and ticketing systems, allowing service teams to (iii) synthesize “runtime monitors” to exploit enterprise-level operations strength by providing telemetry about the status of a service’s conformance to a proved protocol.\n\n#### **Final example: Automating regulatory compliance**\n\nAt the recent ++[Computer-Aided Verification](https://ucl-pplv.github.io/CAV21/home)++ (CAV ’21) workshop called Formal Approaches to Certifying Compliance (talks recorded and ++[available](https://ucl-pplv.github.io/CAV21/workshop_facc/)++), we heard from ++[NIST](https://www.nist.gov/)++, ++[Coalfire](https://www.coalfire.com/solutions/cloud-security)++, ++[Collins Aerospace](https://www.rockwellcollins.com/)++, ++[DARPA](https://www.darpa.mil/)++, and Amazon about the use of automated reasoning to lower the cost and the time-to-market added by regulatory compliance.\n\nKarthik Amrutesh of the Amazon Web Services security assurance team reported that automated reasoning enabled a 91% reduction in the time it took for our third-party auditor to produce evidence for checking controls. For perhaps the first time in the more than 2,500-year history of mathematical logic, we see a business use case that exploits the difference between finding proofs and checking proofs. What's the difference? Finding is usually the hard part, the creative part, the part that requires sophisticated algorithms. Finding is usually undecidable or ++[NP-complete](https://en.wikipedia.org/wiki/NP-completeness)++, depending on the context.\n\nMeanwhile, not only is checking proofs decidable in most cases, but it’s often linear in the size of the proof. To check proofs, compliance auditors can use well-understood and trusted small solvers such as HOL-light.\n\nUsing cloud-scale automation to find the proofs lowers cost. That lets the auditor offer its services for less, saving the customer money. It also reduces the latency of audits, a major pain point for developers looking to go to market quickly.\n\nAn audit check involves constraints on the form that valid text strings can take. The set of constraints is known as a string theory, and the imposition of that theory means that audit checks are SMT problems.\n\nFrom the perspective of automated-reasoning science, it becomes important to build string theory solvers that can efficiently construct easily checkable proof artifacts. In the realm of propositional satisfiability — SAT problems — the DRAT proof checker is now the standard methodology for communicating proofs. But in SMT, no such standard exists. What would a general-purpose theory-agnostic SMT format and checker look like?\n\n#### **Conclusion**\n\nWe've come a long way from days when automated reasoning was the exclusive domain of circuit designers or aerospace engineers. Success in these early domains kicked off a virtuous cycle for the makers of the theorem provers that power automated reasoning. With applications for mainstream applications such as cloud computing, the automated-reasoning virtuous cycle is now radically accelerating. After 2,500 years of mathematical-logic research and 70+ years of automated-reasoning science, we live in a heady time. With wider adoption of and investment in automated reasoning, we are seeing economies of scale where what we can do now would have been unimaginable even two or three years ago. Welcome to the future!\n\nABOUT THE AUTHOR\n\n#### **[Byron Cook](https://www.amazon.science/author/byron-cook)**\n\nByron Cook is a leader in the field of formal verification, known for his contributions to SAT, SMT, and symbolic model checking, with applications to biological systems, computer operating systems, programming languages, and security. Byron’s work on automated reasoning at Amazon has led to higher levels of assurance in the cloud as well as new customer features.","render":"<p>Automated reasoning is the algorithmic search through the infinite set of theorems in mathematical logic. We can use automated reasoning to answer questions about what systems such as biological models and computer programs can and cannot do in the wild.</p>\n<p>In the 1990s, AMD, IBM, Intel, and other companies invested in automated reasoning for circuit and microprocessor design, leading to today’s widely used and industry-standard hardware formal-verification tools (e.g., <ins><a href=\\"https://www.cadence.com/en_US/home/tools/system-design-and-verification/formal-and-static-verification/jasper-gold-verification-platform.html\\" target=\\"_blank\\">JasperGold</a></ins>). In the 2000s, automated reasoning expanded to niche software domains such as device drivers (e.g., <ins><a href=\\"https://docs.microsoft.com/en-us/windows-hardware/drivers/devtest/static-driver-verifier\\" target=\\"_blank\\">Static Driver Verifier</a></ins>) or transportation systems (e.g., <ins><a href=\\"https://www.prover.com/\\" target=\\"_blank\\">Prover technology</a></ins>). In the 2010s, we saw automated reasoning increasingly applied to our foundational computing infrastructure, such as cryptography, networking, storage, and virtualization.</p>\n<p>With recently launched cloud services such as <ins><a href=\\"https://docs.aws.amazon.com/IAM/latest/UserGuide/what-is-access-analyzer.html\\" target=\\"_blank\\">IAM Access Analyzer</a></ins> and <ins><a href=\\"https://docs.aws.amazon.com/vpc/latest/network-access-analyzer/what-is-vaa.html\\" target=\\"_blank\\">VPC Network Access Analyzer</a></ins>, automated reasoning is now beginning to change how computer systems built on top of the cloud are developed and operated.</p>\n<p>All these applications of automated reasoning rest on a common foundation: automated and semi-automated mechanical theorem provers. <ins><a href=\\"https://github.com/acl2/acl2\\" target=\\"_blank\\">ACL2</a></ins>, <ins><a href=\\"https://cvc5.github.io/\\" target=\\"_blank\\">CVC5</a></ins>, <ins><a href=\\"https://github.com/jrh13/hol-light\\" target=\\"_blank\\">HOL-light’s Meson_tac</a></ins>, <ins><a href=\\"http://minisat.se/\\" target=\\"_blank\\">MiniSat</a></ins>, and <ins><a href=\\"https://github.com/vprover/\\" target=\\"_blank\\">Vampire</a></ins> are a few examples, but there are many more we could name. They are all, in outline, working on the same problem: the search for proofs in mathematical logic.</p>\n<p>Over the past 30 years, slowly but surely, a <ins><a href=\\"https://www.youtube.com/watch?v=3kM2hFNZAio\\" target=\\"_blank\\">virtuous cycle</a></ins> has formed: automated reasoning in specific and critical application areas drives more investment in foundational tools, while improvements in the foundational tools drive further applications. Around and around.</p>\n<p><img src=\\"https://dev-media.amazoncloud.cn/fe9a35845ab5464088632c1003782b61_image.png\\" alt=\\"image.png\\" /></p>\n<p>The propositional-satisfiability problem (a.k.a. SAT) is NP-complete, and in the case of unstructured decision graphs (left), the problem instances can be prohibitively time consuming to solve. But when the decision graphs have some inherent structure (right), automatic solvers can exploit that structure to find solutions efficiently.<br />\\nVISUALIZATIONS PRODUCED BY CARSTEN SINZ, USING HIS <ins><a href=\\"https://github.com/msoos/3dVis\\" target=\\"_blank\\">3DVIS</a></ins> VISUALIZATION TOOL</p>\n<p>The increasingly difficult benchmarks driving the development of these tools present new science opportunities. International competitions such as <ins><a href=\\"http://www.tptp.org/CASC/\\" target=\\"_blank\\">CASC</a></ins>, <ins><a href=\\"http://www.satcompetition.org/\\" target=\\"_blank\\">SAT-COMP</a></ins>, <ins><a href=\\"https://smt-comp.github.io/2021/\\" target=\\"_blank\\">SMT-COMP</a></ins>, <ins><a href=\\"https://sv-comp.sosy-lab.org/2021/\\" target=\\"_blank\\">SV-COMP</a></ins>, and the <ins><a href=\\"http://termination-portal.org/wiki/Termination_Competition\\" target=\\"_blank\\">Termination competition</a></ins> have accelerated this virtuous cycle. On the application side, with increasing power from the tools come new research opportunities in the design of customer-intuitive tools (such as models of <ins><a href=\\"https://biomodelanalyzer.org/\\" target=\\"_blank\\">cellular signaling pathways</a></ins> or Amazon’s <ins><a href=\\"https://www.amazon.science/publications/stratified-abstraction-of-access-control-policies\\" target=\\"_blank\\">abstraction of control policies</a></ins> for cloud computing).</p>\n<p>As an example of the virtuous cycle at work, consider the following graph, which shows the results for all of the winners of <ins><a href=\\"http://www.satcompetition.org/\\" target=\\"_blank\\">SAT-COMP</a></ins> from 2002 to 2021, compared apples-to-apples in a competition with the same hardware and same benchmarks:</p>\n<p><img src=\\"https://dev-media.amazoncloud.cn/1992dd3565f2406a968acb52ded52c52_image.png\\" alt=\\"image.png\\" /></p>\n<p>This graph plots the number of benchmarks that each solver can solve in 200 seconds, 400 seconds, etc. The higher the line, the more benchmarks the solver could solve. By looking at the plot we can see, for example, that the 2010 winner (<ins><a href=\\"https://github.com/msoos/cryptominisat\\" target=\\"_blank\\">cryptominisat</a></ins>) solved approximately 50 benchmarks within the allotted 1,000 seconds, whereas the 2021 winner (<ins><a href=\\"http://fmv.jku.at/kissat/\\" target=\\"_blank\\">kissat</a></ins>) can solve nearly four times as many benchmarks in the same time, using the same hardware. Why did the tools get better? Because members of the scientific community pushing on the application submitted benchmarks to the competitions, which helped tool developers take the tools to new heights of performance and scale.</p>\n<p>At Amazon we see the velocity of the virtuous cycle dramatically increasing. Our automated-reasoning tools are now called billions of times daily, with growth rates exceeding 100% year-over-year. For example, Amazon Web Services customers now have access to automated-reasoning-based features such as <ins><a href=\\"https://docs.aws.amazon.com/IAM/latest/UserGuide/what-is-access-analyzer.html\\" target=\\"_blank\\">IAM Access Analyzer</a></ins>, <ins><a href=\\"https://aws.amazon.com/s3/features/block-public-access/\\" target=\\"_blank\\">S3 Block Public Access</a></ins>, or <ins><a href=\\"https://docs.aws.amazon.com/vpc/latest/reachability/what-is-reachability-analyzer.html\\" target=\\"_blank\\">VPC Reachability Analyzer</a></ins>. We also see Amazon development teams using tools such as <ins><a href=\\"https://github.com/dafny-lang/dafny\\" target=\\"_blank\\">Dafny</a></ins>, <ins><a href=\\"https://github.com/p-org/P\\" target=\\"_blank\\">P</a></ins>, and <ins><a href=\\"https://saw.galois.com/\\" target=\\"_blank\\">SAW</a></ins>.</p>\n<p>What’s most exciting to me as an automated-reasoning scientist is that our research area seems to be entering a golden era. I think we are beginning to witness a transformation in automated reasoning that is similar to what happened in virtualized computing as the cloud’s virtuous cycle spun up. As described in <ins><a href=\\"https://www.youtube.com/watch?v=OdzaTbaQwTg\\" target=\\"_blank\\">Werner Vogels’s 2019 re:Invent keynote</a></ins>, Amazon Web Services’s <ins><a href=\\"https://aws.amazon.com/ec2/nitro/\\" target=\\"_blank\\">EC2</a></ins> team was driven by unprecedented customer adoption to reinvent its hypervisor, microprocessor, and networking stack, capturing significant improvements in security, cost, and team agility made possible by economies of scale.</p>\n<p>There are parallels in automated reasoning today. Dramatic new infrastructure is needed for viable business reasons, putting a spotlight on research questions that were previously obscure and unsolved. Below I outline three examples of open research areas driven by the increasing scale of automated-reasoning tools and our underlying computing infrastructure.</p>\n<h4><a id=\\"Example_Distributed_proof_search_29\\"></a><strong>Example: Distributed proof search</strong></h4>\\n<p>For over two decades the automated-reasoning scientific community has postulated that distributed-systems-based proof search could be faster than sequential proof search. But we didn’t have the economic scale to justify serious investigation of the question.</p>\n<p>At Amazon, with our increased reliance on automated reasoning, we now have that kind of scale. For example, we sponsored the new cloud-based-tool tracks in several international competitions.</p>\n<p>Compare the <ins><a href=\\"https://github.com/domschrei/mallob\\" target=\\"_blank\\">mallob-mono</a></ins> solver, the winner of SAT-COMP’s new cloud-solver track, to the single-microprocessor solvers:</p>\n<p><img src=\\"https://dev-media.amazoncloud.cn/19169d63979b49559df1266e994d762f_image.png\\" alt=\\"image.png\\" /></p>\n<p>Mallob-mono is now, by a wide margin, the most powerful SAT solver on the planet. And like the sequential solvers, the distributed solvers are improving.</p>\n<p>As described in Kuhn’s seminal book <ins><a href=\\"https://en.wikipedia.org/wiki/The_Structure_of_Scientific_Revolutions\\" target=\\"_blank\\"><i>The Structure of Scientific Revolutions</i></a></ins>, major perspective shifts like this tend to trigger scientific revolutions. The success of distributed proof search raises the possibility of similar revolutions. For example, we may need to re-evaluate our assumptions about when to use <ins><a href=\\"https://en.wikipedia.org/wiki/Evaluation_strategy\\" target=\\"_blank\\">eager vs. lazy reduction techniques</a></ins> when converting between formalisms.</p>\n<p>Here at Amazon, we recently reconsidered the PhD dissertation of University of California, Berkeley, professor <ins><a href=\\"http://people.eecs.berkeley.edu/~sseshia/\\" target=\\"_blank\\">Sanjit Seshia</a></ins> in light of mallob-mono and were able to quickly (in about 2,000 lines of Rust) develop a new eager-reduction-based solver that outperforms today’s leading lazy-reduction tools on the notoriously difficult SMT-COMP bcnscheduling and job_shop benchmarks. Here we are solving SAT problems that go beyond Booleans, to involve integers, real numbers, strings, or functions. We call this SAT modulo theories, or SMT.</p>\n<p>In the graph below we compare the performance of leading lazy SMT solvers <ins><a href=\\"https://cvc5.github.io/\\" target=\\"_blank\\">CVC5</a></ins> and <ins><a href=\\"https://github.com/Z3Prover/z3\\" target=\\"_blank\\">Z3</a></ins> to a Seshia-style eager solver based on the SAT solvers Kissat and mallob-mono on those benchmarks:</p>\n<p><img src=\\"https://dev-media.amazoncloud.cn/8cb43f543e4b4b808f6ce19f58bbd7be_image.png\\" alt=\\"image.png\\" /></p>\n<p>We’ve published the code for <ins><a href=\\"https://github.com/awslabs/rust-smt-ir\\" target=\\"_blank\\">our Seshia-style eager solver</a></ins> on GitHub.</p>\n<p>There are many other open questions driven by distributed proof search. For example, is there an effective lookahead-solver strategy for <ins><a href=\\"https://en.wikipedia.org/wiki/Satisfiability_modulo_theories\\" target=\\"_blank\\">SMT</a></ins> that would facilitate <ins><a href=\\"https://github.com/marijnheule/CnC\\" target=\\"_blank\\">cube-and-conquer</a></ins>? Or as the <ins><a href=\\"https://engineering.fb.com/2019/08/15/security/zoncolan/\\" target=\\"_blank\\">Zoncolan</a></ins> service does when analyzing programs for security vulnerabilities, can we memoize intermediate lemmas in a cloud database and reuse them, rather than recomputing for each query? Can <ins><a href=\\"https://en.wikipedia.org/wiki/Monte_Carlo_tree_search\\" target=\\"_blank\\">Monte Carlo tree search</a></ins> in the cloud on past proofs be used to synthesize more-effective proof search strategies?</p>\n<h4><a id=\\"Another_example_Reasoning_about_distributed_systems_53\\"></a><strong>Another example: Reasoning about distributed systems</strong></h4>\\n<p>Recent examples of formal reasoning within Amazon Web Services at the level of distributed-protocol design include a proof of S3’s recently announced <ins><a href=\\"https://aws.amazon.com/s3/consistency/\\" target=\\"_blank\\">strong consistency</a></ins> and the <ins><a href=\\"https://dl.acm.org/doi/10.1145/3319535.3354228\\" target=\\"_blank\\">protocol-level proof of secrecy in Amazon Web Services’s KMS service</a></ins>. The problem with these proofs is that they apply to the protocols that power the distributed services, not necessarily to the code running on the servers that use those protocols.</p>\n<p>Here at Amazon, we believe that automated reasoning at the level of protocol design has the greatest long-term value when the investment cost is amortized and protected via continuous integration/continuous delivery (CI/CD) integrations with the code that implements the protocols. That is, the benefit of upfront effort is often seen later, when protocol compliance proofs fail on buggy changes to implementation source code. The code doesn’t make it to production until the developers have fixed it.</p>\n<p>Again: major perspective shifts like those resulting from successful proofs about S3 and KMS could trigger a revolution, à la <ins><a href=\\"https://en.wikipedia.org/wiki/The_Structure_of_Scientific_Revolutions\\" target=\\"_blank\\">Kuhn</a></ins>. For years, we have had tools for reasoning about distributed systems, such as TLA+ and P. But with the success of the work with S3 and KMS, it’s now clear that protocol design should be a first-class concept for engineering, with tools that support it, proactively finding errors and proving properties.</p>\n<p>These tools should also connect to the source code that speaks the protocols by (i) constructing specifications that can be proved with existing code-level tools and (ii) synthesizing implementation code in languages such as C, Go, Rust, or Java. The tools would facilitate integration into our CI/CD, code review, and ticketing systems, allowing service teams to (iii) synthesize “runtime monitors” to exploit enterprise-level operations strength by providing telemetry about the status of a service’s conformance to a proved protocol.</p>\n<h4><a id=\\"Final_example_Automating_regulatory_compliance_63\\"></a><strong>Final example: Automating regulatory compliance</strong></h4>\\n<p>At the recent <ins><a href=\\"https://ucl-pplv.github.io/CAV21/home\\" target=\\"_blank\\">Computer-Aided Verification</a></ins> (CAV ’21) workshop called Formal Approaches to Certifying Compliance (talks recorded and <ins><a href=\\"https://ucl-pplv.github.io/CAV21/workshop_facc/\\" target=\\"_blank\\">available</a></ins>), we heard from <ins><a href=\\"https://www.nist.gov/\\" target=\\"_blank\\">NIST</a></ins>, <ins><a href=\\"https://www.coalfire.com/solutions/cloud-security\\" target=\\"_blank\\">Coalfire</a></ins>, <ins><a href=\\"https://www.rockwellcollins.com/\\" target=\\"_blank\\">Collins Aerospace</a></ins>, <ins><a href=\\"https://www.darpa.mil/\\" target=\\"_blank\\">DARPA</a></ins>, and Amazon about the use of automated reasoning to lower the cost and the time-to-market added by regulatory compliance.</p>\n<p>Karthik Amrutesh of the Amazon Web Services security assurance team reported that automated reasoning enabled a 91% reduction in the time it took for our third-party auditor to produce evidence for checking controls. For perhaps the first time in the more than 2,500-year history of mathematical logic, we see a business use case that exploits the difference between finding proofs and checking proofs. What’s the difference? Finding is usually the hard part, the creative part, the part that requires sophisticated algorithms. Finding is usually undecidable or <ins><a href=\\"https://en.wikipedia.org/wiki/NP-completeness\\" target=\\"_blank\\">NP-complete</a></ins>, depending on the context.</p>\n<p>Meanwhile, not only is checking proofs decidable in most cases, but it’s often linear in the size of the proof. To check proofs, compliance auditors can use well-understood and trusted small solvers such as HOL-light.</p>\n<p>Using cloud-scale automation to find the proofs lowers cost. That lets the auditor offer its services for less, saving the customer money. It also reduces the latency of audits, a major pain point for developers looking to go to market quickly.</p>\n<p>An audit check involves constraints on the form that valid text strings can take. The set of constraints is known as a string theory, and the imposition of that theory means that audit checks are SMT problems.</p>\n<p>From the perspective of automated-reasoning science, it becomes important to build string theory solvers that can efficiently construct easily checkable proof artifacts. In the realm of propositional satisfiability — SAT problems — the DRAT proof checker is now the standard methodology for communicating proofs. But in SMT, no such standard exists. What would a general-purpose theory-agnostic SMT format and checker look like?</p>\n<h4><a id=\\"Conclusion_77\\"></a><strong>Conclusion</strong></h4>\\n<p>We’ve come a long way from days when automated reasoning was the exclusive domain of circuit designers or aerospace engineers. Success in these early domains kicked off a virtuous cycle for the makers of the theorem provers that power automated reasoning. With applications for mainstream applications such as cloud computing, the automated-reasoning virtuous cycle is now radically accelerating. After 2,500 years of mathematical-logic research and 70+ years of automated-reasoning science, we live in a heady time. With wider adoption of and investment in automated reasoning, we are seeing economies of scale where what we can do now would have been unimaginable even two or three years ago. Welcome to the future!</p>\n<p>ABOUT THE AUTHOR</p>\n<h4><a id=\\"Byron_Cookhttpswwwamazonscienceauthorbyroncook_83\\"></a><strong><a href=\\"https://www.amazon.science/author/byron-cook\\" target=\\"_blank\\">Byron Cook</a></strong></h4>\n<p>Byron Cook is a leader in the field of formal verification, known for his contributions to SAT, SMT, and symbolic model checking, with applications to biological systems, computer operating systems, programming languages, and security. Byron’s work on automated reasoning at Amazon has led to higher levels of assurance in the cloud as well as new customer features.</p>\n"}