• Separation Logic

  • Referenced in 8 articles [sw28549]
  • algorithms on lists, hash-tables, and union-find trees. We also provide abstract interfaces...
  • Conley-Morse-Database

  • Referenced in 3 articles [sw30144]
  • continuation theorems from the clutching data Union-Find structures; Annotating continuation classes with Conley Index...
  • GcPan

  • Referenced in 3 articles [sw22677]
  • methods (such as reference counting and union-find) are applied in order to garbage collect...
  • Auto2_Imperative_HOL

  • Referenced in 2 articles [sw32246]
  • trees, interval trees, priority queue, quicksort, union-find, Dijkstra’s algorithm, and a sweep-line...
  • Coq

  • Referenced in 1888 articles [sw00161]
  • Coq is a formal proof management system. It...
  • VRP

  • Referenced in 1069 articles [sw05207]
  • The Vehicle Routing Problem (VRP) is one of...
  • OCaml

  • Referenced in 273 articles [sw06363]
  • OCaml is the most popular variant of the...
  • Ynot

  • Referenced in 35 articles [sw12334]
  • Ynot, dependent types for imperative programs. We describe...
  • BSDS

  • Referenced in 188 articles [sw14427]
  • The Berkeley Segmentation Dataset and Benchmark. A database...
  • VACID-0

  • Referenced in 5 articles [sw21613]
  • VACID-0: Verification of Ample Correctness of Invariants...
  • ACE

  • Referenced in 9 articles [sw22675]
  • ACE: an automatic complexity evaluator. There has been...
  • Grail

  • Referenced in 5 articles [sw26751]
  • Grail: a functional form for imperative mobile code...
  • Camelot

  • Referenced in 4 articles [sw28213]
  • Resource-safe functional programming language Camelot....
  • Bedrock

  • Referenced in 4 articles [sw28530]
  • The Bedrock Structured Programming System: Combining Generative Metaprogramming...