• LiQuor

  • Referenced in 18 articles [sw04136]
  • terms of a probabilistic guarded command language with an operational semantics based on (finite) Markov ... qualitative or quantitative analysis for omega-regular linear time properties by means of automata-based...
  • nSPARQL

  • Referenced in 13 articles [sw11895]
  • proposed the nSPARQL query language for RDF, that uses nested regular expressions as building blocks ... expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation ... nested regular expression E over an RDF graph G can be computed in time...
  • Montre

  • Referenced in 2 articles [sw30369]
  • timed regular expressions as a compact, natural, and highly-expressive pattern specification language for monitoring ... applications involving quantitative timing constraints. Our tool essentially incorporates online and offline timed pattern matching...
  • PROCOL

  • Referenced in 8 articles [sw02535]
  • constraints PROCOL is an object-oriented language with distributed delegation. It strongly supports concurrency: many ... active at a time, however special interrupt Actions may interrupt regular Actions. Communication is performed...
  • S3

  • Referenced in 7 articles [sw19495]
  • expressive enough for widespread applicability. Specifically, our language covers all the main string operations, such ... membership in a set defined by a regular expression can be encoded as string equations ... definitive answers) and its efficiency (about 20 times faster) against the state...
  • JiTCODE

  • Referenced in 4 articles [sw24715]
  • derivative symbolically and it is just-in-time-compiled, allowing the user to efficiently integrate ... differential equations from a higher-level interpreted language. The presented modules are particularly suited ... complete automatization of the process of estimating regular as well as transversal Lyapunov exponents ... demonstrate their capabilities by application to timely problems.{parcopyright 2018 American Institute of Physics...
  • JiTCSDE

  • Referenced in 4 articles [sw24716]
  • derivative symbolically and it is just-in-time-compiled, allowing the user to efficiently integrate ... differential equations from a higher-level interpreted language. The presented modules are particularly suited ... complete automatization of the process of estimating regular as well as transversal Lyapunov exponents ... demonstrate their capabilities by application to timely problems.{parcopyright 2018 American Institute of Physics...
  • JiTCDDE

  • Referenced in 3 articles [sw24714]
  • derivative symbolically and it is just-in-time-compiled, allowing the user to efficiently integrate ... differential equations from a higher-level interpreted language. The presented modules are particularly suited ... complete automatization of the process of estimating regular as well as transversal Lyapunov exponents ... demonstrate their capabilities by application to timely problems.{parcopyright 2018 American Institute of Physics...
  • UUhistle

  • Referenced in 2 articles [sw27423]
  • visually and interactively exploring the execution-time behavior of computer programs. Through UUhistle’s graphics ... programming concepts and programming-language constructs. Unlike a regular debugger, UUhistle displays challenging aspects...
  • CTF

  • Referenced in 7 articles [sw25687]
  • structure by subdividing tensors cyclically, producing a regular parallel decomposition. An internal virtualization layer provides ... mapping for each tensor contraction at run-time via explicit calculations of memory usage ... form of a domain specific language. We demonstrate performance of CC with single and double...
  • MUSCOP

  • Referenced in 6 articles [sw06143]
  • optimal control problems (OCPs) constrained by time-periodic partial differential equations (PDEs). The proposed method ... forward problem method. For three regularization approaches to recover convergence our analysis shows that ... hybrid language programming paradigm to minimize setup and solution time for new application problems...
  • biXid

  • Referenced in 9 articles [sw12667]
  • this relation. Our contributions here are specific language features for facilitating realistic conversions whose target ... details. Concretely, we (1) adopt XDuce-style regular expression patterns for describing and analyzing ... enough expressiveness and a linear-time performance from experiments with several realistic bidirectional transformations including...
  • stringi

  • Referenced in 1 article [sw35637]
  • character string/text/natural language processing tools: pattern searching (e.g., with ’Java’-like regular expressions ... concatenation, sorting, padding, wrapping, Unicode normalisation, date-time formatting and parsing, and many more. They...
  • Mumbo

  • Referenced in 1 article [sw07651]
  • implementation of a run-time program generation language We describe our efforts to use rule ... produce a model of Jumbo, a run-time program generation (RTPG) system for Java. Jumbo ... RTPG following the simple principle that the regular compiler -- or, rather, its back ... time compilation. This tends to produce a run-time compiler that is inefficient but potentially...
  • TXP

  • Referenced in 1 article [sw32264]
  • declarative language that provides a rich set of operators based on regular expressions over sequences ... features are to allow multi-cycle behavior, time shift operations in the past or future...
  • MORPHIX

  • Referenced in 2 articles [sw32880]
  • morphological regularities of these languages to define a fine-grained word-class-specific subclassification. Morphological ... German language. In spite of the complexity of the German inflection, the average time required...
  • Agents.jl

  • Referenced in 3 articles [sw31967]
  • triangular 2D grids, and simple or toroidal regular cubic 3D grids with von Neumann ... agent distributions on grids. Julia is a language that is especially suitable for ABMs, because ... Python, but is up to 13 times faster than Mesa while using much less lines...
  • DReX

  • Referenced in 2 articles [sw16949]
  • languages using regular expressions. While these combinators form the basis for the language DReX proposed ... pass evaluation algorithm for consistent programs with time complexity that is linear in the length...
  • YAKKER

  • Referenced in 2 articles [sw17046]
  • full scannerless context-free grammars with (2) regular expressions as right-hand sides for defining ... such as sophisticated libraries for dates and times, may be directly incorporated into parser specifications ... examples ranging from difficult programming language grammars to web server logs to binary data specification...
  • CCMpred

  • Referenced in 1 article [sw17014]
  • such methods exist, either relying on regularized inversion of the covariance matrix or on pseudo ... sufficiently optimized and are written in interpreted languages that introduce additional overheads. This impedes ... predict contacts for typical alignments 35–113 times faster and with the same precision...