Alessandro Cimatti

From MaRDI portal
Person:329418

Available identifiers

zbMath Open cimatti.alessandroDBLP13/5961WikidataQ62036606 ScholiaQ62036606MaRDI QIDQ329418

List of research outcomes





PublicationDate of PublicationType
Extended bounded response LTL: a new safety fragment for efficient reactive synthesis2025-01-13Paper
Expressiveness of extended bounded response \textsf{LTL}2024-12-06Paper
Invariant checking for SMT-based systems with quantifiers2024-11-12Paper
Efficient analysis of cyclic redundancy architectures via Boolean fault propagation2024-02-01Paper
A first-order logic characterisation of safety and co-safety languages2024-01-23Paper
Searching for ribbon-shaped paths in fair transition systems2024-01-23Paper
Searching for i-good lemmas to accelerate safety model checking2024-01-12Paper
Verification Modulo theories2023-10-30Paper
Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans2023-10-02Paper
A first-order logic characterization of safety and co-safety languages2023-08-26Paper
SMT-based model checking of max-plus linear systems2023-08-21Paper
Verification of SMT systems with quantifiers2023-06-02Paper
Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test2023-06-02Paper
Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis2023-05-26Paper
Assumption-based runtime verification2023-05-08Paper
Analysis of cyclic fault propagation via ASP2023-04-04Paper
\textsc{LTL} falsification in infinite-state systems2022-12-08Paper
Abstraction Modulo Stability for Reverse Engineering2022-12-07Paper
\(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\)2022-10-28Paper
Safe Decomposition of Startup Requirements: Verification and Synthesis2022-10-13Paper
Diagnosability of fair transition systems2022-07-08Paper
Automatic discovery of fair paths in infinite-state transition systems2022-06-22Paper
Implicit semi-algebraic abstraction for polynomial dynamical systems2022-03-25Paper
Optimization modulo non-linear arithmetic via incremental linearization2022-03-24Paper
Universal invariant checking of parametric systems with quantifier-free SMT reasoning2021-12-01Paper
Proving the existence of fair paths in infinite-state systems2021-10-18Paper
Synthesis of P-stable abstractions2021-07-08Paper
Formal specification and verification of dynamic parametrized architectures2021-05-04Paper
Computation of the transient in max-plus linear systems via SMT-solving2021-03-02Paper
Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF2020-08-05Paper
SMT-based satisfiability of first-order LTL with event freezing functions and metric operators2020-05-26Paper
From electrical switched networks to hybrid automata2020-01-03Paper
Infinite-State Liveness-to-Safety via Implicit Abstraction and Well-Founded Relations2019-05-03Paper
Mechanizing multi-agent reasoning with belief contexts2019-04-29Paper
Formal reliability analysis of redundancy architectures2019-03-13Paper
Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions2018-10-24Paper
Experimenting on solving nonlinear integer arithmetic with incremental linearization2018-08-10Paper
Tightening the contract refinements of a system architecture2018-08-08Paper
Satisfiability modulo transcendental functions via incremental linearization2017-09-22Paper
Infinite-state invariant checking with IC3 and predicate abstraction2017-07-26Paper
Satisfiability checking and symbolic computation2017-06-21Paper
Dynamic controllability via timed game automata2016-10-21Paper
$$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation2016-08-30Paper
Formal Verification of Infinite-State BIP Models2016-01-08Paper
Formal Safety Assessment via Contract-Based Design2015-12-17Paper
HRELTL: a temporal logic for hybrid systems2015-12-07Paper
An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty2015-11-18Paper
Formal Design of Asynchronous Fault Detection and Identification Components using Temporal Epistemic Logic2015-11-05Paper
Efficient generation of craig interpolants in satisfiability modulo theories2015-09-17Paper
Solving strong controllability of temporal problems with uncertainty using SMT2015-04-29Paper
Quantifier-free encoding of invariants for hybrid systems2014-12-05Paper
SMT-based scenario verification for hybrid systems2014-03-28Paper
Encoding RTL constructs for \textsc{MathSAT}: a preliminary report2013-09-26Paper
Verifying industrial hybrid systems with \textsc{MathSAT}2013-09-20Paper
The MathSAT5 SMT Solver2013-08-05Paper
A Modular Approach to MaxSAT Modulo Theories2013-08-05Paper
Software model checking with explicit scheduler and symbolic threads2012-08-15Paper
Boosting Lazy Abstraction for SystemC with Partial Order Reduction2011-05-19Paper
Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories2011-05-04Paper
From Sequential Extended Regular Expressions to NFA with Symbolic Labels2011-02-11Paper
Satisfiability Modulo the Theory of Costs: Foundations and Applications2010-04-27Paper
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis2009-11-16Paper
Interpolant Generation for UTVPI2009-07-28Paper
Requirements Validation for Hybrid Systems2009-06-30Paper
A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories2009-03-10Paper
Verifying Heap-Manipulating Programs in an SMT Framework2008-07-03Paper
Symbolic Fault Tree Analysis for Reactive Systems2008-07-03Paper
Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis2008-05-27Paper
To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$2008-05-27Paper
SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA2008-05-20Paper
Efficient Interpolant Generation in Satisfiability Modulo Theories2008-04-11Paper
Diagnostic Information for Realizability2008-04-04Paper
Boolean Abstraction for Temporal Logic Satisfiability2007-11-29Paper
A Symbolic Model Checking Framework for Safety Analysis, Diagnosis, and Synthesis2007-11-01Paper
Strong planning under partial observability2007-10-23Paper
Symbolic Implementation of Alternating Automata2007-09-06Paper
Formal Methods for Hardware Verification2007-05-02Paper
M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures2007-01-24Paper
Efficient theory combination via Boolean search2006-10-25Paper
Formal Methods in Computer-Aided Design2006-10-20Paper
Weak, strong, and strong cyclic planning via symbolic model checking2006-02-07Paper
Conformant planning via symbolic model checking and heuristic search2006-02-07Paper
Computer Aided Verification2006-01-10Paper
Tools and Algorithms for the Construction and Analysis of Systems2005-11-10Paper
https://portal.mardi4nfdi.de/entity/Q48188182004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48087222004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48090562004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47369972004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47371242004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44220822003-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44179102003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44133732003-07-17Paper
https://portal.mardi4nfdi.de/entity/Q48049092003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q45320802002-05-28Paper
https://portal.mardi4nfdi.de/entity/Q27695952002-02-05Paper
https://portal.mardi4nfdi.de/entity/Q45272712001-06-04Paper
https://portal.mardi4nfdi.de/entity/Q45245032001-01-15Paper
NuSMV: A new symbolic model checker2000-01-01Paper
Computational reflection via mechanized logical deduction1997-01-13Paper

Research outcomes over time

This page was built for person: Alessandro Cimatti