Log in

Relevant bibliographies by topics / CHC solver

Contents

Journal articles

Academic literature on the topic 'CHC solver'

Author: Grafiati

Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'CHC solver.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "CHC solver"

1

Zhu, He, Stephen Magill, and Suresh Jagannathan. "A data-driven CHC solver." ACM SIGPLAN Notices 53, no. 4 (2018): 707–21. http://dx.doi.org/10.1145/3296979.3192416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

DE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Solving Horn Clauses on Inductive Data Types Without Induction." Theory and Practice of Logic Programming 18, no. 3-4 (2018): 452–69. http://dx.doi.org/10.1017/s1471068418000157.

Full text

Abstract:

AbstractWe address the problem of verifying the satisfiability of Constrained Horn Clauses (CHCs) based on theories of inductively defined data structures, such as lists and trees. We propose a transformation technique whose objective is the removal of these data structures from CHCs, hence reducing their satisfiability to a satisfiability problem for CHCs on integers and booleans. We propose a transformation algorithm and identify a class of clauses where it always succeeds. We also consider an extension of that algorithm, which combines clause transformation with reasoning on integer constra

APA, Harvard, Vancouver, ISO, and other styles

3

Faella, Marco, and Gennaro Parlato. "Reachability Games Modulo Theories with a Bounded Safety Player." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 5 (2023): 6330–37. http://dx.doi.org/10.1609/aaai.v37i5.25779.

Full text

Abstract:

Solving reachability games is a fundamental problem for the analysis, verification, and synthesis of reactive systems. We consider logical reachability games modulo theories (in short, GMTs), i.e., infinite-state games whose rules are defined by logical formulas over a multi-sorted first-order theory. Our games have an asymmetric constraint: the safety player has at most k possible moves from each game configuration, whereas the reachability player has no such limitation. Even though determining the winner of such a GMT is undecidable, it can be reduced to the well-studied problem of checking

APA, Harvard, Vancouver, ISO, and other styles

4

Mordvinov, Dmitry A. "Property-Directed Inference of Relational Invariants." Modeling and Analysis of Information Systems 26, no. 4 (2019): 550–71. http://dx.doi.org/10.18255/1818-1015-2019-4-550-571.

Full text

Abstract:

Property Directed Reachability (PDR) is an efficient and scalable approach to solving systems of symbolic constraints also known as Constrained Horn Clauses (CHC). In the case of non-linear CHCs, which may arise, e.g., from relational verification tasks, PDR aims to infer an inductive invariant for each uninterpreted predicate. However, in many practical cases this reasoning is not successful, as invariants should be derived for groups of predicates instead of individual predicates. The article describes a novel algorithm that identifies these groups automatically and complements the existing

APA, Harvard, Vancouver, ISO, and other styles

5

Gheorghiu, Călin-Ioan. "Chebfun Solutions to a Class of 1D Singular and Nonlinear Boundary Value Problems." Computation 10, no. 7 (2022): 116. http://dx.doi.org/10.3390/computation10070116.

Full text

Abstract:

The Chebyshev collocation method implemented in Chebfun is used in order to solve a class of second order one-dimensional singular and genuinely nonlinear boundary value problems. Efforts to solve these problems with conventional ChC have generally failed, and the outcomes obtained by finite differences or finite elements are seldom satisfactory. We try to fix this situation using the new Chebfun programming environment. However, for tough problems, we have to loosen the default Chebfun tolerance in Newton’s solver as the ChC runs into trouble with ill-conditioning of the spectral differentiat

APA, Harvard, Vancouver, ISO, and other styles

6

DE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Predicate Pairing for program verification." Theory and Practice of Logic Programming 18, no. 2 (2017): 126–66. http://dx.doi.org/10.1017/s1471068417000497.

Full text

Abstract:

AbstractIt is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). However, state-of-the-art solvers for constrained Horn clauses (or CHC solvers) based onpredicate abstractionare sometimes unable to verify satisfiability because they look for models that are definable in a given class 𝓐 of constraints, called 𝓐-definable models. We introduce a transformation technique, calledPredicate Pairing, which is able, in many interesting cases, to transform a set of clauses into an equ

APA, Harvard, Vancouver, ISO, and other styles

7

Sun, Jintao, Qi Chen, Baoming Zhao, et al. "Temperature-dependent ion chemistry in nanosecond discharge plasma-assisted CH₄ oxidation." Journal of Physics D: Applied Physics 55, no. 13 (2022): 135203. http://dx.doi.org/10.1088/1361-6463/ac45ac.

Full text

Abstract:

Abstract Ion chemistry with temperature evolution in weakly ionized plasma is important in plasma-assisted combustion and plasma-assisted catalysis, fuel reforming, and material synthesis due to its contribution to plasma generation and state transition. In this study, the kinetic roles of ionic reactions in nanosecond discharge (NSD) plasma-assisted temperature-dependent decomposition and oxidation of methane are investigated by integrated studies of experimental measurements and mathematical simulations. A detailed plasma chemistry mechanism governing the decomposition and oxidation processe

APA, Harvard, Vancouver, ISO, and other styles

8

Zhou, Wenjun, Xi Qin, Ming Lv, Lifeng Qiu, Zhongjiang Chen, and Fan Zhang. "Design of Plasmonic Photonic Crystal Fiber for Highly Sensitive Magnetic Field and Temperature Simultaneous Measurement." Micromachines 14, no. 9 (2023): 1684. http://dx.doi.org/10.3390/mi14091684.

Full text

Abstract:

A high-sensitivity plasmonic photonic crystal fiber (PCF) sensor is designed and a metal thin film is embedded for achieving surface plasmon resonance (SPR), which can detect the magnetic field and temperature simultaneously. Within the plasmonic PCF sensor, the SPR sensing is accomplished by coating both the upper sensing channel (Ch1) and the lower sensing channel (Ch2) with gold film. In addition, the temperature-sensitive medium polydimethylsiloxane (PDMS) is chosen to fill in Ch1, allowing the sensor to respond to the temperature. The magnetic field-sensitive medium magnetic fluid (MF) is

APA, Harvard, Vancouver, ISO, and other styles

9

Vieira, Bernardo C., Fabrício V. Andrade, and Antônio O. Fernandes. "Framework for Generating Configurable SAT Solvers." Journal of Integrated Circuits and Systems 6, no. 1 (2011): 50–59. http://dx.doi.org/10.29292/jics.v6i1.338.

Full text

Abstract:

The state-of-the-art SAT solvers usually share the same core techniques, for instance: the watched literals structure, conflict clause recording and non-chronological backtracking. Nevertheless, they might differ in the elimination of learnt clauses, as well as in the decision heuristic. This article presents a framework for generating configurable SAT solvers. The proposed framework is composed of the following components: a Base SAT Solver, a Perl Preprocessor, XML files (Solver Description and Heuristics Description files) to describe each heuristic as well as the set of heuristics that the

APA, Harvard, Vancouver, ISO, and other styles

10

Webb, Penny. "A way to solve problems." Child Care 14, no. 3 (2017): 4–5. http://dx.doi.org/10.12968/chca.2017.14.3.4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!