Pages that link to "Item:Q5901905"
From MaRDI portal
The following pages link to Verification, Model Checking, and Abstract Interpretation (Q5901905):
Displaying 15 items.
- A tool for deciding the satisfiability of continuous-time metric temporal logic (Q262137) (← links)
- Bounded model checking of ETL cooperating with finite and looping automata connectives (Q364388) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Constraint LTL satisfiability checking without automata (Q472802) (← links)
- Bounded semantics (Q483292) (← links)
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Computation of the transient in max-plus linear systems via SMT-solving (Q1996024) (← links)
- TOrPEDO : witnessing model correctness with topological proofs (Q2065548) (← links)
- Counterexample-preserving reduction for symbolic model checking (Q2336646) (← links)
- Periodicity based decidable classes in a first order timed logic (Q2368906) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Linear templates of ACTL formulas with an application to SAT-based verification (Q2398494) (← links)
- Linear Completeness Thresholds for Bounded Model Checking (Q3088266) (← links)
- Verifying Real-Time Properties of Multi-agent Systems via SMT-Based Bounded Model Checking (Q4571143) (← links)
