Recommendations
Cited in
(21)- A study of symmetry breaking predicates and model counting
- On local domain symmetry for model expansion
- Solving quantifier-free first-order constraints over finite sets and binary relations
- CompoSAT: specification-guided coverage for model finding
- Pardinus: a temporal relational model finder
- Specification-based program repair using SAT
- Automating Algebraic Specifications of Non-freely Generated Data Types
- Alloy*: a general-purpose higher-order relational constraint solver
- Monotonicity inference for higher-order formulas
- Exploring theories with a model-finding assistant
- Monotonicity inference for higher-order formulas
- Recognition of Nested Gates in CNF Formulas
- Bounded Relational Analysis of Free Data Types
- Automated flaw detection in algebraic specifications
- Kodkod
- Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
- From LCF to Isabelle/HOL
- Handling transitive relations in first-order automated reasoning
- Model finding for recursive functions in SMT
- Automatic proof and disproof in Isabelle/HOL
- Constraint solving for finite model finding in SMT solvers
This page was built for publication: Kodkod: A Relational Model Finder
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758136)