ACL2 is a mathematical logic, programming language, and mechanical theorem prover based on the applicative subset of Common Lisp. It is an "industrial-strength" version of the NQTHM or Boyer/Moore theorem prover, and has been used for the formal verification of commercial microprocessors, the Java Virtual Machine, interesting algorithms, and so forth.
Daikon is an implementation of dynamic detection of likely invariants. An invariant is a property (such as "x=2*y+5" or "this.next.prev = this" or "myarray is sorted by <") that holds at a certain point or points in a program. Invariants are often seen in assert statements, documentation, and formal specifications. Invariants can be useful in program understanding and a host of other applications. Daikon runs a program, observes the values that the program computes, and then reports properties that were true over the observed executions. It can detect properties in Java, C, C++, Perl, and IOA programs, in spreadsheet files, and in other data sources.
The RL-Glue is intended to provide a foundation for building benchmarks for reinforcement learning (RL) agents. A secondary goal is to support RL competitions in which agents are compared in their performance on new problems that are only revealed at the time of a competition. The current version of the interface software supports direct function call communication between agents and environments written in C. The interface software also provides a standard mechanism for communication between agents and environments written in different programming languages.
MARF is a general cross-platform framework with a collection of algorithms for audio (voice, speech, and sound) and natural language text analysis and recognition, along with sample applications (identification, NLP, etc.) of its use. MARF can run distributed over the network (CORBA, Java RMI, and Java XML-RPC Web Services) and may act as a library in applications or be used as a source for learning and extension.
Grammar Browser provides a simple-to-use graphical interface to the grammatical structure and relations of any text, as parsed by the Stanford Parser. It contains a grammatical relation editor to modify, import, and export grammatical relation definitions (tregex patterns and features).