Runtime Verification is a subfield of verification aimed at providing formal guarantees about complex systems as they execute.  This novel approach intends to provide the same mathematical rigor as traditional, static verification techniques while providing a scalable approach that can verify even complex applications and properties with minimal runtime overhead.  Unlike traditional verification, runtime verification techniques can be deployed with production systems, providing extra assurance that the desired properties and specifications are never violated.  There are a broad range of runtime verification-based analysis techniques, ranging from simply checking complex properties at runtime to exhaustively verifying the state space of a program through symbolic execution.  Runtime verification can also be leveraged as a model checking approach or development methodology.  We will explore a few applications of runtime verification to practical and production-quality tools, exploring various subfields including predictive runtime verification and semantics-based program execution for automatic undefinedness and error checking.  We will focus on tools that can be applied by developers today with little to no additional input, detecting a broad range of potential errors automatically.  We will briefly explore the potential of these tools to be leveraged for full program verification with additional user input, and discuss the pitfalls and benefits of both the predictive and semantics-based verification approaches.  We will demonstrate these properties through practical demonstrations of our RV-Predict and RV-Match tools, which are freely available for download, evaluation, and academic use from the runtime verification website.  We will showcase the ability of our techniques to soundly and maximally detect data race violations, as well as to automatically detect undefined C programs which could introduce nondeterministic program behaviors.  We will discuss common problems with other techniques, including false positives, restrictive system requirements, and the inability to handle complex programs or execution environments common in real world software systems.  We will briefly discuss future academic and industrial work in this space, and hope to connect those interested in verification with the powerful and user-friendly tools aimed at allowing achieving levels of program validation and verification with the minimum possible developer input.