The following pages link to Alessandro Cimatti (Q329418):
Displaying 50 items.
- Dynamic controllability via timed game automata (Q329422) (← links)
- Quantifier-free encoding of invariants for hybrid systems (Q479826) (← links)
- Formal reliability analysis of redundancy architectures (Q667523) (← links)
- (Q814466) (redirect page) (← links)
- Weak, strong, and strong cyclic planning via symbolic model checking (Q814470) (← links)
- Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
- Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
- Implicit semi-algebraic abstraction for polynomial dynamical systems (Q832202) (← links)
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- HRELTL: a temporal logic for hybrid systems (Q897648) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Tightening the contract refinements of a system architecture (Q1654565) (← links)
- Experimenting on solving nonlinear integer arithmetic with incremental linearization (Q1656597) (← links)
- NuSMV: A new symbolic model checker (Q1856168) (← links)
- Computation of the transient in max-plus linear systems via SMT-solving (Q1996024) (← links)
- Formal specification and verification of dynamic parametrized architectures (Q2024379) (← links)
- Synthesis of P-stable abstractions (Q2038042) (← links)
- Universal invariant checking of parametric systems with quantifier-free SMT reasoning (Q2055851) (← links)
- \(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\) (Q2094389) (← links)
- \textsc{LTL} falsification in infinite-state systems (Q2105460) (← links)
- Automatic discovery of fair paths in infinite-state transition systems (Q2147176) (← links)
- Diagnosability of fair transition systems (Q2152493) (← links)
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators (Q2182731) (← links)
- Proving the existence of fair paths in infinite-state systems (Q2234061) (← links)
- From electrical switched networks to hybrid automata (Q2281635) (← links)
- Solving strong controllability of temporal problems with uncertainty using SMT (Q2342602) (← links)
- Infinite-state invariant checking with IC3 and predicate abstraction (Q2363814) (← links)
- Satisfiability modulo transcendental functions via incremental linearization (Q2405243) (← links)
- Efficient theory combination via Boolean search (Q2432765) (← links)
- SMT-based scenario verification for hybrid systems (Q2441772) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- Analysis of cyclic fault propagation via ASP (Q2694609) (← links)
- (Q2769595) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- (Q2848685) (← links)
- (Q2849590) (← links)
- Software Model Checking with Explicit Scheduler and Symbolic Threads (Q2904614) (← links)
- Efficient generation of craig interpolants in satisfiability modulo theories (Q2946624) (← links)
- Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories (Q2996914) (← links)
- Boosting Lazy Abstraction for SystemC with Partial Order Reduction (Q3000665) (← links)
- From Sequential Extended Regular Expressions to NFA with Symbolic Labels (Q3073625) (← links)
- Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF (Q3303890) (← links)
- Formal Design of Asynchronous Fault Detection and Identification Components using Temporal Epistemic Logic (Q3449766) (← links)
- Formal Safety Assessment via Contract-Based Design (Q3457781) (← links)
- Formal Verification of Infinite-State BIP Models (Q3460575) (← links)
- SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA (Q3503089) (← links)
- Symbolic Fault Tree Analysis for Reactive Systems (Q3510794) (← links)
- Verifying Heap-Manipulating Programs in an SMT Framework (Q3510799) (← links)
- Satisfiability Modulo the Theory of Costs: Foundations and Applications (Q3557072) (← links)
