Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Larraz, Daniel"'
Autor:
Larraz, Daniel, Tinelli, Cesare
We present a new feature of the open-source model checker Kind 2 which checks whether a component contract is realizable; i.e., it is possible to construct a component such that for any input allowed by the contract assumptions, there is some output
Externí odkaz:
http://arxiv.org/abs/2205.09082
We introduce two new major features of the open-source model checker Kind 2 which provide traceability information between specification and design elements such as assumptions, guarantees, or other behavioral constraints in synchronous reactive syst
Externí odkaz:
http://arxiv.org/abs/2105.06575
Autor:
Borralleras, Cristina, Larraz, Daniel, Oliveras, Albert, Rodriguez-Carbonell, Enric, Rubio, Albert
We present new methods for solving the Satisfiability Modulo Theories problem over the theory of Quantifier-Free Non-linear Integer Arithmetic, SMT(QF-NIA), which consists in deciding the satisfiability of ground formulas with integer polynomial cons
Externí odkaz:
http://arxiv.org/abs/2008.13601
Autor:
Brockschmidt, Marc, Larraz, Daniel, Oliveras, Albert, Rodriguez-Carbonell, Enric, Rubio, Albert
We present an automated compositional program verification technique for safety properties based on conditional inductive invariants. For a given program part (e.g., a single loop) and a postcondition $\varphi$, we show how to, using a Max-SMT solver
Externí odkaz:
http://arxiv.org/abs/1507.03851
Publikováno v:
Ada User Journal. Mar2023, Vol. 44 Issue 1, p44-48. 5p.
Autor:
Larraz, Daniel1 daniel-larraz@uiowa.edu, Tinelli, Cesare1 cesare-tinelli@uiowa.edu
Publikováno v:
Ada User Journal. Dec2022, Vol. 43 Issue 4, p261-268. 8p.
Publikováno v:
Automated Reasoning
The abduction problem in logic asks whether there exists a formula that is consistent with a given set of axioms and, together with these axioms, suffices to entail a given goal. We propose an approach for solving this problem that is based on syntax
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmc_________::fb5efcce8ed637e57d2483233f63e4eb
http://europepmc.org/articles/PMC7324138
http://europepmc.org/articles/PMC7324138
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Candeago, Lorenzo, Larraz, Daniel, Oliveras, Albert, Rodríguez-Carbonell, Enric, Rubio, Albert
Publikováno v:
Theory & Applications of Satisfiability Testing - SAT 2016; 2016, p284-301, 18p