The following pages link to (Q4326390):
Displaying 50 items.
- A transformation-based approach to implication of GSTE assertion graphs (Q364478) (← links)
- A model checking-based approach for security policy verification of mobile systems (Q432137) (← links)
- The right tools for the job: correctness of cone of influence reduction proved using ACL2 and HOL4 (Q540690) (← links)
- Abstract reduction in directed model checking CCS processes (Q715051) (← links)
- Automated analysis of fault-tolerance in distributed systems (Q816197) (← links)
- Weighted automata and weighted logics with discounting (Q840767) (← links)
- Weighted automata and weighted logics on infinite words (Q845080) (← links)
- Verification of evolving software via component substitutability analysis (Q934712) (← links)
- Automatic symbolic compositional verification by learning assumptions (Q934713) (← links)
- An automatic abstraction technique for verifying featured, parameterised systems (Q947791) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- An iterative approach to verification of real-time systems (Q1346652) (← links)
- A methodology to take credit for high-level verification during RTL verification (Q1696592) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Infinite-state invariant checking with IC3 and predicate abstraction (Q2363814) (← links)
- Weighted automata and weighted logics (Q2373736) (← links)
- GSTE is partitioned model checking (Q2385196) (← links)
- Model checking with fairness assumptions using PAT (Q2418662) (← links)
- An automatic method for the dynamic construction of abstractions of states of a formal model (Q2452756) (← links)
- Verification of Boolean programs with unbounded thread creation (Q2464944) (← links)
- Abstractions of data types (Q2491212) (← links)
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps (Q2505621) (← links)
- Model checking with strong fairness (Q2505624) (← links)
- Compositional SCC analysis for language emptiness (Q2505627) (← links)
- Refinement preserving approximations for the design and verification of heterogeneous systems (Q2642667) (← links)
- Specification and Verification using Message Sequence Charts (Q2841317) (← links)
- A Logical Process Calculus (Q2842601) (← links)
- Introduction to Model Checking (Q3176359) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Transfer of Model Checking to Industrial Practice (Q3176381) (← links)
- Approximating Behaviors in Embedded System Design (Q3507398) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Safe Reasoning with Logic LTS (Q3599086) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Survey on Directed Model Checking (Q3614878) (← links)
- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (Q3617729) (← links)
- Abstract Counterexamples for Non-disjunctive Abstractions (Q3646262) (← links)
- Abstraction and composition: a verification method for co-operating systems (Q4783359) (← links)
- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning (Q5054804) (← links)
- Proving the Refuted: Symbolic Model Checkers as Proof Generators (Q5187831) (← links)
- Meanings of Model Checking (Q5187832) (← links)
- Complexity and Algorithms for Monomial and Clausal Predicate Abstraction (Q5191104) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- Efficient Automatic STE Refinement Using Responsibility (Q5458330) (← links)