• UMFPACK

  • Referenced in 415 articles [sw00989]
  • ordering and symbolic analysis phase computes an upper bound on fill-in, work, and memory ... user from the details of the complex sparse factorization data structures by returning simple handles...
  • BOXES

  • Referenced in 6 articles [sw21178]
  • over upper- and lower-bounds constraints. Our implementation is symbolic, and weds the strengths ... Binary Decision Diagrams (BDDs) and Box. The complexity of the operations (meet, join, transfer functions...
  • LoAT

  • Referenced in 3 articles [sw23213]
  • technique to infer lower bounds on the worst-case runtime complexity of integer programs ... this end, we construct symbolic representations of program executions using a framework for iterative, under ... ranking functions. Afterwards, we deduce asymptotic lower bounds from the resulting simplified programs. We implemented...
  • ASpecPaired-Matrix

  • Referenced in 3 articles [sw15022]
  • this paper is to show how the symbolic computation capabilities of Mathematica allow ... presented. For the matrix case, nontrivial essentially bounded and rational examples, computed with the analytical ... considered paired singular integral operator, if a complex number (chosen arbitrarily) belongs to its spectrum...
  • ASpecPaired-Scalar

  • Referenced in 3 articles [sw15023]
  • this paper is to show how the symbolic computation capabilities of Mathematica allow ... presented. For the matrix case, nontrivial essentially bounded and rational examples, computed with the analytical ... considered paired singular integral operator, if a complex number (chosen arbitrarily) belongs to its spectrum...
  • PNMC

  • Referenced in 1 article [sw29139]
  • Symbolic Model Checker for Petri Nets: pnmc. Symbolic model checking with decision diagrams ... both CPU and memory bounded: in addition to the algorithms complexity, the limiting factors ... failing one. We present pnmc, a symbolic model checker for Petri Nets, and libsdd...
  • ACETAF

  • Referenced in 7 articles [sw00014]
  • ACETAF: A software package for computing validated bounds...
  • ADOL-C

  • Referenced in 249 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • ATLAS

  • Referenced in 199 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • AXIOM

  • Referenced in 173 articles [sw00063]
  • Axiom is a general purpose Computer Algebra system...
  • Boolector

  • Referenced in 31 articles [sw00085]
  • Boolector: an efficient SMT solver for bit-vectors...
  • Cadabra

  • Referenced in 91 articles [sw00097]
  • Cadabra is a powerful computer program for the...
  • CASA

  • Referenced in 105 articles [sw00108]
  • CASA is a special-purpose system for computational...
  • CGAL

  • Referenced in 394 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • CoCoA

  • Referenced in 654 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • Coq

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

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • C-XSC

  • Referenced in 110 articles [sw00181]
  • C-XSC. A programming environment for verified scientific...
  • C-XSC 2.0

  • Referenced in 127 articles [sw00182]
  • A C++ class library for extended scientific computing...
  • DEMiCs

  • Referenced in 21 articles [sw00196]
  • DEMiCs is a software package written in C...