Kodkod: A Relational Model Finder
From MaRDI portal
Publication:5758136
DOI10.1007/978-3-540-71209-1_49zbMath1186.68304OpenAlexW1519503479MaRDI QIDQ5758136
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
Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A Study of Symmetry Breaking Predicates and Model Counting, Automatic Proof and Disproof in Isabelle/HOL, Recognition of Nested Gates in CNF Formulas, Exploring Theories with a Model-Finding Assistant, Automated flaw detection in algebraic specifications, On local domain symmetry for model expansion, Constraint solving for finite model finding in SMT solvers, Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA, Monotonicity inference for higher-order formulas, Automating Algebraic Specifications of Non-freely Generated Data Types, Specification-Based Program Repair Using SAT, Alloy*: a general-purpose higher-order relational constraint solver, Monotonicity Inference for Higher-Order Formulas, CompoSAT: specification-guided coverage for model finding, From LCF to Isabelle/HOL, Bounded Relational Analysis of Free Data Types, Solving quantifier-free first-order constraints over finite sets and binary relations, Model Finding for Recursive Functions in SMT, Kodkod, Handling transitive relations in first-order automated reasoning, Pardinus: a temporal relational model finder
