| Monitoring hyperproperties |
3 |
| TeLEx: learning signal temporal logic from positive examples using tightness metric |
3 |
| A survey of challenges for runtime verification from advanced application domains (beyond software) |
2 |
| Probabilistic black-box reachability checking (extended version) |
1 |
| Incrementally closing octagons |
1 |
| An improved algorithm for the control synthesis of nonlinear sampled switched systems |
1 |
| Conditions of contracts for separating responsibilities in heterogeneous systems |
1 |
| Solving parity games via priority promotion |
1 |
| Validating numerical semidefinite programming solvers for polynomial invariants |
1 |
| Efficient verification of railway infrastructure designs against standard regulations |
1 |
| Quantitative monitoring of STL with edit distance |
1 |
| Finite-trace linear temporal logic: coinductive completeness |
1 |
| Non-intrusive runtime monitoring through power consumption to enforce safety and security properties in embedded systems |
0 |
| Inferring event stream abstractions |
0 |
| Wireless protocol validation under uncertainty |
0 |
| On the complexity of monitoring Orchids signatures, and recurrence equations |
0 |
| Tightening the contract refinements of a system architecture |
0 |
| Theory and methodology of assumption/commitment based system interface specification and architectural contracts |
0 |
| Synthesizing adaptive test strategies from temporal logic specifications |
0 |
| Refutation-based synthesis in SMT |
0 |
| Learning analysis strategies for octagon and context sensitivity from labeled data generated by static analyses |
0 |
| Inferring functional properties of matrix manipulating programs by abstract interpretation |
0 |
| Enforcing termination of interprocedural analysis |
0 |
| Abstracting Nash equilibria of supermodular games |
0 |
| Securing a compiler transformation |
0 |
| On relative and probabilistic finite counterability |
0 |
| Exploiting partial variable assignment in interpolation-based model checking |
0 |
| Template polyhedra and bilinear optimization |
0 |
| Quantitative static analysis of communication protocols using abstract Markov chains |
0 |
| A new abstraction framework for affine transformers |
0 |
| Compact and efficiently verifiable models for concurrent systems |
0 |
| Realizability of concurrent recursive programs |
0 |
| Improving the results of program analysis by abstract interpretation beyond the decreasing sequence |
0 |
| Statistical verification of PCTL using antithetic and stratified samples |
0 |
| Some complexity results for stateful network verification |
0 |
| SAT-based explicit LTL reasoning and its application to satisfiability checking |
0 |
| Annotation guided collection of context-sensitive parallel execution profiles |
0 |
| Almost event-rate independent monitoring |
0 |
| Automated verification of automata communicating via FIFO and bag buffers |
0 |
| Algorithmic games for full ground references |
0 |
| Automating regression verification of pointer programs by predicate abstraction |
0 |
| Alloy*: a general-purpose higher-order relational constraint solver |
0 |
| Abstract semantic diffing of evolving concurrent programs |
0 |
