The following pages link to (Q4551177):
Displayed 18 items.
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472) (← links)
- SAT-solving in practice, with a tutorial example from supervisory control (Q843991) (← links)
- Hybrid systems: From verification to falsification by combining motion planning and discrete search (Q1039839) (← links)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. (Q1426130) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Computing properties of stable configurations of thermodynamic binding networks (Q2315010) (← links)
- Verification of SpecC using predicate abstraction (Q2369884) (← links)
- (Q2741533) (← links)
- (Q2842869) (← links)
- Bounded Model Checking with Parametric Data Structures (Q2864380) (← links)
- Interpolant Learning and Reuse in SAT-Based Model Checking (Q2864382) (← links)
- Bounded Synthesis for Petri Games (Q3449635) (← links)
- Limitations of Restricted Branching in Clause Learning (Q3523067) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Falsification of LTL Safety Properties in Hybrid Systems (Q3617769) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Automated generation of hybrid automata for multi-rigid-body mechanical systems and its application to the falsification of safety properties (Q5861104) (← links)