New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.
Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
Claim $300 Free
Secure File Transfer for Windows with Cerberus by Redwood
Protect and share files over FTP/S, SFTP, HTTPS and SCP with the #1 rated Windows file transfer server.
Cerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
The Object-Role Modeling (ORM) standard version 2, associated schemas and generation tools, and a reference implementation in the form of the Natural Object-Role Modeling Architect for Visual Studio (NORMA) product.
Olympos is an holistic MDA/MDD approach to projects. It allows to create Web (PHP, J2EE), Desktop (c#) and Mobile applications (.NET, J2ME) from a UML model. Features a Web 2.0 IDE, a generator based on openArchitectureWare and several cartridges.
A simple visual editor for drawing OPJ models; these models represents an extension to the classic Petri-net diagram; they were developed before the unification of OO methodologies and the relative release of the first UML specification.
ManMetAssembly is an assembly simulator wirtten in Java. The aim is to replace "Sim8086" used in universities, as well as enhancing the simulator by proviging fetch-execute cycle information, as well as features oftern found in modern IDEs.
XUL# is a c# library for writing web and stand-alone application with Mozilla XUL user interface. The same application can be hosted into ASP.NET or Windows.Form (or Mono) Language: C#, XUL, HTML
A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)