The following pages link to Formal Methods in System Design (Q169908):
Displaying 50 items.
- Designing communicating transaction processes by supervisory control theory (Q878112) (← links)
- Special issue: Selected papers from the 9th international workshop on formal methods for industrial critical systems (FMICS 04), Linz, Austria, September 20--21, 2004 (Q880591) (← links)
- From NuSMV to SPIN: Experiences with model checking flight guidance systems (Q883136) (← links)
- Early verification and validation of mission critical systems (Q883137) (← links)
- An abstract interpretation toolkit for \(\mu\)CRL (Q883139) (← links)
- Object oriented concepts identification from formal \(B\) specifications (Q883142) (← links)
- HySAT: An efficient proof engine for bounded model checking of hybrid systems (Q883144) (← links)
- Practical interruptible conversations: distributed dynamic verification with multiparty session types and Python (Q888409) (← links)
- Synthesising correct concurrent runtime monitors (Q888412) (← links)
- Monitoring of temporal first-order properties with aggregations (Q888414) (← links)
- The ins and outs of first-order runtime verification (Q888417) (← links)
- Runtime verification with minimal intrusion through parallelism (Q888419) (← links)
- Hybrid automata-based CEGAR for rectangular hybrid systems (Q888464) (← links)
- Optimization techniques for Craig interpolant compaction in unbounded model checking (Q888467) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- Three optimizations for assume-guarantee reasoning with \(L^{*}\) (Q934701) (← links)
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning (Q934706) (← links)
- Automated assumption generation for compositional verification (Q934710) (← links)
- Verification of evolving software via component substitutability analysis (Q934712) (← links)
- Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
- Automatic verification of distributed systems: the process algebra approach. (Q960505) (← links)
- Combining partial-order reductions with on-the-fly model-checking. (Q960506) (← links)
- On the computational power of binary decision diagram with redundant variables. (Q960508) (← links)
- Hiding propositional constants in BDDs. (Q960509) (← links)
- Performability assessment by model checking of Markov reward models (Q968359) (← links)
- Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols (Q968361) (← links)
- Pushdown module checking (Q968362) (← links)
- Special issue: Select papers from the 19th international conference (CAV 2007), Berlin, Germany, July 3--7, 2007. (Q1006109) (← links)
- An approach for extracting a small unsatisfiable core (Q1028724) (← links)
- The symbolic OBDD scheme for generating mechanical assembly sequences (Q1028726) (← links)
- Robust safety of timed automata (Q1028728) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- Safely composing security protocols (Q1028731) (← links)
- Before and after vacuity (Q1028732) (← links)
- Timed verification of the generic architecture of a memory circuit using parametric timed automata (Q1028737) (← links)
- Hybrid systems: From verification to falsification by combining motion planning and discrete search (Q1039839) (← links)
- Approximated parameterized verification of infinite-state processes with global conditions (Q1039841) (← links)
- Local proofs for global safety properties (Q1039842) (← links)
- Coverage-guided test generation for continuous and hybrid systems (Q1039844) (← links)
- From liveness to promptness (Q1039845) (← links)
- Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations (Q1039847) (← links)
- Functional verification of power gated designs by compositional reasoning (Q1039850) (← links)
- Reducing concurrent analysis under a context bound to sequential analysis (Q1039852) (← links)
- Computing differential invariants of hybrid systems as fixed points (Q1039853) (← links)
- Word level bitwidth reduction for unbounded hardware model checking (Q1039855) (← links)
- Decision problems for lower/upper bound parametric timed automata (Q1041291) (← links)
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip (Q1041294) (← links)
- Automating the addition of fault tolerance with discrete controller synthesis (Q1041296) (← links)
- The \(HOL\) logic extended with quantification over type variables (Q1309243) (← links)
- Lazy techniques for fully expansive theorem proving (Q1309245) (← links)
