Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #51 to #100.

View ( | ) (20 | 50 | 100 | 250 | 500)

  1. Assumption-based runtime verification: Label: en
  2. Specifiable robustness in reactive synthesis: Label: en
  3. Functional synthesis via input-output separation: Label: en
  4. LTL model checking of self modifying code: Label: en
  5. Control strategies for off-line testing of timed systems: Label: en
  6. Interpolation with guided refinement: revisiting incrementality in SAT-based unbounded model checking: Label: en
  7. Verification Modulo theories: Label: en
  8. Machine learning and logic: a new frontier in artificial intelligence: Label: en
  9. On monitoring linear temporal properties: Label: en
  10. Mining definitions in Kissat with Kittens: Label: en
  11. SMT-based verification of program changes through summary repair: Label: en
  12. Achieving high coverage in hardware equivalence checking via concolic verification: Label: en
  13. Obituary: Edmund Melson Clarke jun. (1945--2020): Label: en
  14. Introduction to the special issue on runtime verification: Label: en
  15. Finite-trace linear temporal logic: coinductive completeness: Label: en
  16. Quantitative monitoring of STL with edit distance: Label: en
  17. Wireless protocol validation under uncertainty: Label: en
  18. On the complexity of monitoring Orchids signatures, and recurrence equations: Label: en
  19. Towards efficient verification of population protocols: Label: en
  20. Decentralised LTL monitoring: Label: en
  21. Exploiting interleaving semantics in symbolic state-space generation: Label: en
  22. Learning to verify branching time properties: Label: en
  23. Refinement preserving approximations for the design and verification of heterogeneous systems: Label: en
  24. An algebraic theory for behavioral modeling and protocol synthesis in system design: Label: en
  25. Concurrency in synchronous systems: Label: en
  26. A predictive synchronizer for periodic clock domains: Label: en
  27. A framework for modeling the distributed deployment of synchronous designs: Label: en
  28. Reasoning about synchronization in GALS systems: Label: en
  29. Compositional SCC analysis for language emptiness: Label: en
  30. Model checking with strong fairness: Label: en
  31. An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps: Label: en
  32. Special issue: 1st international workshop on runtime verification (RV'01). Selected papers based on the presentation at the workshop, Paris, France, July 23, 2001.: Label: en
  33. Verification of parametric concurrent systems with prioritised FIFO resource management: Label: en
  34. A congruence relation for sPBC: Label: en
  35. Constructing invariants for hybrid systems: Label: en
  36. Abstractions for hybrid systems: Label: en
  37. Optimal infinite scheduling for multi-priced timed automata: Label: en
  38. Special issue: Selected papers based on the presentations at the 7th international conference on hybrid systems and control (HSCC 2004), Philadelphia, USA, March 25--27, 2004.: Label: en
  39. Memory model sensitive bytecode verification: Label: en
  40. The word problem for visibly pushdown languages described by grammars: Label: en
  41. Finding optimal hardware/software partitions: Label: en
  42. Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006): Label: en
  43. Checking extended CTL properties using guarded quotient structures: Label: en
  44. SMT proof checking using a logical framework: Label: en
  45. Being careful about theory combination: Label: en
  46. SMT-based scenario verification for hybrid systems: Label: en
  47. Symbolic backward reachability with effectively propositional logic. Application to security policy analysis: Label: en
  48. Efficiently solving quantified bit-vector formulas: Label: en
  49. Preface to the special issue ``SI: satisfiability modulo theories: Label: en
  50. Efficient data race detection for async-finish parallelism: Label: en

View ( | ) (20 | 50 | 100 | 250 | 500)