The following pages link to (Q3940830):
Displaying 50 items.
- A mechanism of function calls in MSVL (Q344760) (← links)
- Recent advances in program verification through computer algebra (Q351971) (← 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)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Explaining counterexamples using causality (Q453516) (← 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)
- 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)
- 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)
- On the semantics of strategy logic (Q894440) (← 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)
- Local proofs for global safety properties (Q1039842) (← links)
- Systems of agents controlled by logical programs: complexity of verification (Q1040334) (← links)
- Automatic symmetry detection for Promela (Q1040774) (← 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)
- 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)
- Reasoning about graded strategy quantifiers (Q1706169) (← 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)
- Dependences in strategy logic (Q1987514) (← links)
- Vacuity in practice: temporal antecedent failure (Q2018060) (← links)
- Improving parity games in practice (Q2043434) (← links)
- A sound and complete proof system for a unified temporal logic (Q2197533) (← links)
- Model-checking precision agriculture logistics: the case of the differential harvest (Q2220343) (← links)
- Beyond vacuity: towards the strongest passing formula (Q2248090) (← links)
- On the order of test goals in specification-based testing (Q2270689) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Synthesizing adaptive test strategies from temporal logic specifications (Q2280227) (← links)
- Natural strategic ability (Q2289013) (← links)
- A novel approach to verifying context free properties of programs (Q2290651) (← links)
