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
99.99% Uptime for MySQL and PostgreSQL Databases
Sub-second maintenance. 2x read/write performance. Built-in vector search for AI apps.
Cloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
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.
The Coverage Simulator transforms test models. The satisfaction of a weaker coverage criterion on the target model corresponds to the satisfaction of a stronger coverage criterion on the source model. Thus, it supports many model-based test generators.
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
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.
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.