With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
$300 Free Credits for Your Google Cloud Projects
Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Write, check, index and diagram Z specifications in Microsoft Word.
Tools to allow Z specifications to be written in Microsoft Word. Includes a unicode font for Z symbols. Provides: WYSIWYG editing fully integrated into Word; Typechecking using fuzz (for Spivey Z) or CZT (for ISO standard Z); Indexing and cross-referencing; Diagrams of specification structure; Conversion from Spivey to Standard Z- also available as a stand-alone program and Java class for non-windows users. See project website for details.
pmMDA - poor man MDA - is a pragmatic MDA code generation engine based on Velocity. The implementation is done in Java. The input model is defined using UML tools - e.g. ArgoUML -. Target frameworks are provided to realize complex applications.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Java objects that share parts of immutable graphs. Reused subgraphs have directly or indirectly recursive Elements. Selected components get replaced by new counterparts in Context of Mirrors - translation tables. Deep copies are not involved.