• CESAR

  • Referenced in 125 articles [sw08510]
  • high level language inspired from CSP and specifications are a set of formulas...
  • Casper

  • Referenced in 92 articles [sw06559]
  • simple, abstract language, and produce a CSP description of the same protocol, suitable for checking...
  • Circus

  • Referenced in 75 articles [sw21828]
  • refinement; it is a unification of imperative CSP, Z, and the refinement calculus. We describe...
  • Choco

  • Referenced in 54 articles [sw06254]
  • java library for constraint satisfaction problems (CSP) and constraint programming (CP). It is built...
  • FDR2

  • Referenced in 44 articles [sw11466]
  • establishing properties of models expressed in CSP. An unlicensed version of FDR2 is available...
  • csp2B

  • Referenced in 21 articles [sw07703]
  • csp2B: A practical approach to combining CSP and B. This paper describes the tool csp2B ... which provides a means of combining CSP-like descriptions with standard B specifications. The notation ... CSP provides a convenient way of describing the order in which the operations ... function of the tool is to convert CSP-like specifications into standard machine-readable...
  • CUTGEN1

  • Referenced in 37 articles [sw14833]
  • Standard One-dimensional Cutting Stock Problem (1D-CSP) is developed. The problem is defined...
  • Sugar

  • Referenced in 19 articles [sw09758]
  • based Constraint Solver. Constraint Satisfaction Problem (CSP) is encoded to a Boolean CNF formula ... solve Constraint Optimization Problems (COP) and Max-CSP. Sugar is an award winning solver ... global constraint categories at the International CSP Solver Competitions ... four categories at the 2008 International Max-CSP Solver Competition. See the results of Sugar...
  • FINDER

  • Referenced in 34 articles [sw06376]
  • domain enumerator. This is a finite domain CSP solver, rather limited in what...
  • CoCasl

  • Referenced in 24 articles [sw13076]
  • Prentice Hall (1989; Zbl 0683.68008)] and CSP [C. A. R. Hoare, Communicating sequential processes. Englewood...
  • Clingcon

  • Referenced in 17 articles [sw09892]
  • monolithic answer set solver Clingo and the CSP solver Gecode. Clingcon is an answer ... driven learning and theory propagation for the CSP solver...
  • CSP-prover

  • Referenced in 10 articles [sw11465]
  • CSP-Prover is an interactive theorem prover dedicated to refinement proofs within the process algebra ... CSP. It aims specifically at proofs on infinite state systems, which may also involve infinite ... determinism. For this reason, CSP-Prover currently focuses on the stable failures model ... underlying denotational semantics of CSP. Semantically, CSP-Prover offers both classical approaches to denotational semantics...
  • CCSP

  • Referenced in 14 articles [sw00111]
  • distributed execution environment based on Hoare’s CSP which allows for the execution and evaluation ... embedded assertions within the CSP program...
  • Isabelle/Circus

  • Referenced in 13 articles [sw15208]
  • specifications, using an integration of Z and CSP with a refinement calculus. Its semantics...
  • FDR3

  • Referenced in 7 articles [sw12387]
  • FDR3 — A Modern Refinement Checker for CSP. FDR3 is a complete rewrite ... CSP refinement checker FDR2, incorporating a significant number of enhancements. In this paper we describe ... uses to construct its internal representation of CSP processes—this algorithm is more efficient than ... able to compile a large class of CSP processes to more efficient internal representations...
  • Proteus

  • Referenced in 5 articles [sw10080]
  • leverage advances in both SAT and CSP solving to present a novel hierarchical portfolio-based ... approach to CSP solving, which we call Proteus, that does not rely purely ... CSP solvers. Instead, it may decide that it is best to encode a CSP problem ... instance of Proteus that involved four CSP solvers, three SAT encodings, and six SAT solvers...
  • VHPOP

  • Referenced in 10 articles [sw20688]
  • versatile heuristic POCL planner competitive with established CSP-based and heuristic state space planners...
  • RealPlan

  • Referenced in 9 articles [sw01619]
  • represented as a Constraint Satisfaction Problem (CSP) problem, and the planner and scheduler interact either...
  • BACP

  • Referenced in 6 articles [sw03472]
  • propagation for the BACP Constraint Satisfaction Problems (CSP) provide a modelling framework for many computer ... associated to an optimization criterion. Solving a CSP consists in finding an assignment of values...
  • CSP2SAT4J

  • Referenced in 4 articles [sw10081]
  • CSP2SAT4J: A Simple CSP to SAT Translator. SAT solvers can now handle very large ... better than dedicated software. During the first CSP competition, SAT-based approaches were demonstrated competitive ... with the other CSP solvers on binary constraints. Constraints being provided in extension ... predicates) and the approaches developed by the CSP community (that usually handle directly the constraints...