Kodkod: A Relational Model Finder
DOI10.1007/978-3-540-71209-1_49zbMATH Open1186.68304OpenAlexW1519503479MaRDI QIDQ5758136FDOQ5758136
Authors: Emina Torlak, Daniel Jackson 
Publication date: 3 September 2007
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71209-1_49
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (21)
- 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
- Model Finding for Recursive Functions in SMT
- 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
- 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
- A Study of Symmetry Breaking Predicates and Model Counting
- Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
- Exploring Theories with a Model-Finding Assistant
- From LCF to Isabelle/HOL
- Handling transitive relations in first-order automated reasoning
- 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)
