Select a tag to browse associated projects and drill deeper into the tag cloud.
Provides a library of matcher objects (also known as constraints or predicates) allowing 'match' rules to be defined declaratively, to be used in other frameworks. Typical scenarios include testing frameworks, mocking libraries and UI validation rules.
The SAT4J project is meant to provide SAT technologies to Java developers. SAT4J 2.0 is currently used in numerous academic projects (see SAT4J web site) and is used in the new Eclipse 3.4 update manager (Equinox p2).
choco: a java library for constraint satisfaction problems (CSP), constraint programming (CP) and explanation-based constraint solving (e-CP).
Choicetool is a configuration management tool like CML2 or Linux kernel kconfig. It uses an input description in order to know the configuration symbols and their inter-relations and creates an outputs a script that should be shipped with a package, in order to let the user tweak the configuration parameters interactively.
Refresh is a constraint-based application configuration framework. Refresh allows application features and components to be annotated with both dependencies and non-functional constraints, using OCL and other languages. Internally, Refresh uses a constraint solver and other algorithms, to deduce the ... [More]
Hampi is a solver for string constraints. Hampi is designed for constraints generated by program analysis tools, automated bug finders, intelligent fuzzers. Hampi constraints express membership in regular languages and bounded context-free languages. Hampi constraints may contain ... [More]
Latest version: Processor of OCL 2.0 expressions v1.3 Our aim is to develop a tool that converts textual constraints written in the OCL 2.0 language into instances of the OCL 2.0 metamodel. To do this we base our design in the existent tool called Dresden OCL2 Toolkit, from the Dresden ... [More]