• Flow*

  • Referenced in 28 articles [sw20162]
  • approaches for handling mode invariants and discrete transitions. Flow* supports a wide variety of optimizations...
  • TAME

  • Referenced in 5 articles [sw28703]
  • proving automaton properties, particularly state and transition invariants. TAME provides two types of strategies: strategies...
  • ASIFT

  • Referenced in 35 articles [sw02778]
  • ASIFT) is introduced. While SIFT is fully invariant with respect to only four parameters namely ... distortions measured by a new parameter, the transition tilt. State-of-the-art methods hardly...
  • TarTar

  • Referenced in 2 articles [sw37080]
  • values for clock bounds in location invariants and transition guards, adding or removing clock resets...
  • Data Refinement IBP

  • Referenced in 3 articles [sw28836]
  • then defining the transitions and proving that they preserve the invariants. Data refinement...
  • VFC package

  • Referenced in 20 articles [sw16729]
  • potential for applications as foundations for invariants in symplectic topology arising from “counting” pseudo-holomorphic ... gluing theorems, that is, smoothness of the transition maps between gluing charts need ... introduce by giving definitions of Gromov-Witten invariants and Hamiltonian Floer homology over...
  • StInG

  • Referenced in 1 article [sw13097]
  • Invarint Generator. StInG computes linear invariants for linear transition systems, automatically...
  • sl2cfoam

  • Referenced in 8 articles [sw26619]
  • EPRL spin foam transition amplitudes a very hard and resource demanding task. With sl2cfoam ... some utilities to evaluate SU (2) invariants, booster functions and SL (2,ℂ) Clebsch-Gordan...
  • UnQL

  • Referenced in 10 articles [sw20018]
  • expressed in first-order logic extended with transitive closure; its data complexity is PTIME ... bisimulation. Structural recursion is shown to be invariant with respect to value equality...
  • DeepSleepNet

  • Referenced in 2 articles [sw21053]
  • encode the temporal information such as stage transition rules, which is important to correctly identify ... time-invariant features, and bidirectional Long Short- Term Memory (bidirectional-LSTM) to learn transition rules...
  • SAL

  • Referenced in 9 articles [sw13318]
  • analysis of concurrent systems specified as transition relations. Its language includes many of the attractive ... infinite-bounded model checkers can prove invariants by k-induction. SAL has been available since...
  • TRANSIT

  • Referenced in 6 articles [sw28674]
  • TRANSIT: specifying protocols with concolic snippets. With the maturing of technology for model checking ... state-machines (EFSM), along with high-level invariants and concrete execution fragments. Our synthesis engine ... model checker with respect to the desired invariants. The counterexamples produced by the model checker ... scenario corresponding to the counterexample. We describe TRANSIT, a language and prototype implementation...
  • HyComp

  • Referenced in 4 articles [sw20163]
  • network into an infinite-state transition system, which can be analyzed using SMT-based verification ... various kinds of dynamics. HyComp can verify invariant and LTL properties, and scenario specifications...
  • pntool

  • Referenced in 2 articles [sw21085]
  • Toolbox five types of Petri nets (untimed, transition-timed, place-timed, stochastic and generalized stochastic ... such as coverability tree, structural properties (including invariants), time-dependent performance indices, max-plus state...
  • HyDI

  • Referenced in 3 articles [sw11912]
  • finite-state automaton structure enriched with invariant and flow conditions to model the continuous dynamics ... compiled into equivalent discrete-time infinite-state transition systems...
  • Apron

  • Referenced in 71 articles [sw00045]
  • Apron: a library of numerical abstract domains for...
  • CLIFFORD

  • Referenced in 85 articles [sw00131]
  • CLIFFORD performs various computations in Grass mann and...
  • CoCoA

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

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

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