Zobrazeno 1 - 10
of 9 282
pro vyhledávání: '"Horn Clauses"'
Autor:
Faella, Marco, Parlato, Gennaro
Verifying programs that manipulate tree data structures often requires complex, ad-hoc proofs that are hard to generalize and automate. This paper introduces an automatic technique for analyzing such programs. Our approach combines automata and logic
Externí odkaz:
http://arxiv.org/abs/2410.09668
Autor:
Carelli, Mishel, Grumberg, Orna
This work proposes a novel approach for automatic verification and synthesis of infinite-state reactive programs with respect to ${CTL}^*$ specifications, based on translation to Existential Horn Clauses (EHCs). $CTL^*$ is a powerful temporal logic,
Externí odkaz:
http://arxiv.org/abs/2408.11502
Publikováno v:
EPTCS 402, 2024, pp. 105-117
Constrained Horn Clauses (CHCs) have conventionally been used as a low-level representation in formal verification. Most existing solvers use a diverse set of specialized techniques, including direct state space traversal or under-approximating abstr
Externí odkaz:
http://arxiv.org/abs/2404.15215
Publikováno v:
EPTCS 402, 2024
This volume contains * The post-proceedings of the Eighteenth Logical and Semantic Frameworks with Applications (LSFA 2023). The meeting was held on July 1-2, 2023, organised by the Sapienza Universit\`a di Roma, Italy. LSFA aims to bring researchers
Externí odkaz:
http://arxiv.org/abs/2404.13672
Clause sets saturated by hierarchic ordered resolution do not offer a model representation that can be effectively queried, in general. They only offer the guarantee of the existence of a model. We present an effective symbolic model construction for
Externí odkaz:
http://arxiv.org/abs/2305.05064
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:
Frohn, Florian, Giesl, Jürgen
Constrained Horn Clauses (CHCs) are often used in automated program verification. Thus, techniques for (dis-)proving satisfiability of CHCs are a very active field of research. On the other hand, acceleration techniques for computing formulas that ch
Externí odkaz:
http://arxiv.org/abs/2303.01827
Publikováno v:
EPTCS 373, 2022
These proceedings include selected papers presented at the 9th Workshop on Horn Clauses for Verification and Synthesis and the Tenth International Workshop on Verification and Program Transformation, both affiliated with ETAPS 2022. Many Program Veri
Externí odkaz:
http://arxiv.org/abs/2211.10675
We address the problem of checking the satisfiability of a set of constrained Horn clauses (CHCs) possibly including more than one query. We propose a transformation technique that takes as input a set of CHCs, including a set of queries, and returns
Externí odkaz:
http://arxiv.org/abs/2211.15207