• SafeDpi

  • Referenced in 10 articles [sw01989]
  • incoming port. We define a sophisticated static type system for these ports, which restrict ... launched by incoming code. Dependent and existential types are used to add flexibility, allowing...
  • LOCKSMITH

  • Referenced in 3 articles [sw20224]
  • sharing analysis for inferring thread locality; existential quantification for modeling locks in data structures ... modeling unsafe features of C such as type casts. When applied to several benchmarks, including...
  • foxPSL

  • Referenced in 1 article [sw13725]
  • hinge-loss Markov Random Fields, a type of continuous Markov Random fields (MRF) in which ... standard PSL with a class system and existential quantifiers, allowing for efficient grounding. Moreover...
  • INTBIS

  • Referenced in 29 articles [sw00442]
  • Algorithm 681: INTBIS, a portable interval Newton/bisection package...
  • SQEMA

  • Referenced in 28 articles [sw03056]
  • Algorithmic correspondence and completeness in modal logic. IV...
  • TPTP

  • Referenced in 216 articles [sw04143]
  • The TPTP (Thousands of Problems for Theorem Provers...
  • OCaml

  • Referenced in 140 articles [sw06363]
  • OCaml is the most popular variant of the...
  • FINDER

  • Referenced in 32 articles [sw06376]
  • Finite domain enumerator. This is a finite domain...
  • SATCHMO

  • Referenced in 67 articles [sw06619]
  • SATCHMO: a theorem prover implemented in Prolog. The...
  • Nuprl

  • Referenced in 318 articles [sw06751]
  • The Nuprl system is a framework for reasoning...
  • Scala

  • Referenced in 46 articles [sw07180]
  • Steps in Scala. An introduction to object-functional...
  • NTRUSign

  • Referenced in 26 articles [sw11764]
  • NTRUSign: Digital signatures using the NTRU lattice. We...
  • CC-Pi

  • Referenced in 19 articles [sw15033]
  • CC-Pi: A Constraint-Based Language for Specifying...
  • 1ML

  • Referenced in 1 article [sw19983]
  • 1ML -- core and modules united (F-ing first...