The following pages link to CESAR (Q20519):
Displaying 50 items.
- A mechanism of function calls in MSVL (Q344760) (← links)
- Formal modeling and verification for MVB (Q364392) (← links)
- A complete proof system for propositional projection temporal logic (Q391223) (← links)
- \textsc{NeVer}: a tool for artificial neural networks verification (Q421446) (← links)
- Towards a notion of unsatisfiable and unrealizable cores for LTL (Q433349) (← links)
- Priority scheduling of distributed systems based on model checking (Q453501) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Explaining counterexamples using causality (Q453516) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- The modeling library of eavesdropping methods in quantum cryptography protocols by model checking (Q518056) (← links)
- Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving (Q617922) (← links)
- Generating counterexamples for quantitative safety specifications in probabilistic B (Q652160) (← links)
- An efficient approach for abstraction-refinement in model checking (Q690465) (← links)
- A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
- Program repair without regret (Q746769) (← links)
- Verifying time partitioning in the DEOS scheduling kernel (Q816194) (← links)
- Distributed symbolic model checking for \(\mu\)-calculus (Q816198) (← links)
- Combining symmetry reduction and under-approximation for symbolic model checking (Q816210) (← links)
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers (Q821566) (← links)
- Algebraic simulations (Q844884) (← links)
- Coverage metrics for temporal logic model checking (Q853721) (← links)
- Question-guided stubborn set methods for state properties (Q862861) (← links)
- On the semantics of strategy logic (Q894440) (← links)
- A canonical form based decision procedure and model checking approach for propositional projection temporal logic (Q896152) (← links)
- A complete axiom system for propositional projection temporal logic with cylinder computation model (Q896162) (← links)
- Augmenting ATL with strategy contexts (Q897650) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems (Q916414) (← links)
- Reasoning about networks with many identical finite state processes (Q921983) (← links)
- Partitioned PLTL model-checking for refined transition systems (Q1023285) (← links)
- Before and after vacuity (Q1028732) (← links)
- Local proofs for global safety properties (Q1039842) (← links)
- Model checking for hybrid logic (Q1047796) (← links)
- Sémantique asynchrone et comportements infinis en CPS (Q1092652) (← links)
- Two normal form theorems for CSP programs (Q1094869) (← links)
- Characterizing finite Kripke structures in propositional temporal logic (Q1123183) (← links)
- Fairness and related properties in transition systems - a temporal logic to deal with fairness (Q1166926) (← links)
- Control machines: A new model of parallelism for compositional specifications and their effective compilation (Q1177148) (← links)
- An experience in proving regular networks of processes by modular model checking (Q1323369) (← links)
- A theory of formal synthesis via inductive learning (Q1674868) (← links)
- Supervisory control and reactive synthesis: a comparative introduction (Q1693819) (← links)
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation (Q1785863) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Module checking (Q1854407) (← links)
- Practical CTL* model checking: Should SPIN be extended? (Q1856161) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Syntax-directed model checking of sequential programs (Q1858441) (← links)
- From pre-historic to post-modern symbolic model checking (Q1878908) (← links)
- Dependences in strategy logic (Q1987514) (← links)
