Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Constraints and Statical Determinacy01:26

Constraints and Statical Determinacy

932
In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...
932
Statically Indeterminate Problem Solving01:16

Statically Indeterminate Problem Solving

675
Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...
675
Theorems of Pappus and Guldinus: Problem Solving01:12

Theorems of Pappus and Guldinus: Problem Solving

1.0K
Pappus and Guldinus's theorems are powerful mathematical principles that are used for finding the surface area and volume of composite shapes. For example, consider a cylindrical storage tank with a conical top. Finding the surface area or volume can be challenging for such complex shapes. These theorems are particularly useful in calculating the volume and surface area of such systems. Here, the cylindrical storage tank with a conical top can be broken down into two simple shapes: a...
1.0K
Formal Charges02:42

Formal Charges

39.6K
In some cases, there are seemingly more than one valid Lewis structures for molecules and polyatomic ions. The concept of formal charges can be used to help predict the most appropriate Lewis structure when more than one reasonable structure exists.
39.6K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

271
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
271
Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

196
A nonlinear inequality describes a comparison involving an expression that curves or behaves more complexly than a straight line. These inequalities often appear in forms that include squares, products, or variables in the denominator.To solve such an inequality, one starts by rewriting it so that zero appears on one side. For example, the inequality:  can be factored as: This form makes it easier to identify the values that cause the expression to equal zero. In this case, the...
196

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

SMT-based verification of program changes through summary repair.

Formal methods in system design·2023
See all related articles

Related Experiment Video

Updated: Jan 11, 2026

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
03:14

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Published on: December 6, 2024

1.0K

Golem: a flexible and efficient solver for constrained Horn clauses.

Martin Blicha1,2, Konstantin Britikov1, Natasha Sharygina1

  • 1University of Lugano, Lugano, Switzerland.

Formal Methods in System Design
|November 10, 2025
PubMed
Summary
This summary is machine-generated.

Golem is a new solver for Constrained Horn Clauses (CHC) over arithmetic, offering flexibility and efficiency. Its architecture and TPA algorithm demonstrate competitive performance in verification tasks.

Keywords:
Constrained Horn clausesModel checkingSatisfiability modulo theoriesSoftware verification

More Related Videos

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.6K
Setting Limits on Supersymmetry Using Simplified Models
07:46

Setting Limits on Supersymmetry Using Simplified Models

Published on: November 15, 2013

8.9K

Related Experiment Videos

Last Updated: Jan 11, 2026

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness
03:14

Augmenting Large Language Models via Vector Embeddings to Improve Domain-Specific Responsiveness

Published on: December 6, 2024

1.0K
Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.6K
Setting Limits on Supersymmetry Using Simplified Models
07:46

Setting Limits on Supersymmetry Using Simplified Models

Published on: November 15, 2013

8.9K

Area of Science:

  • Computer Science
  • Formal Methods
  • Software Engineering

Background:

  • Constrained Horn Clauses (CHC) provide a logical framework for diverse verification tasks.
  • Existing solvers may lack flexibility or efficiency for complex verification problems.

Purpose of the Study:

  • Introduce Golem, a novel solver for CHC satisfiability over linear arithmetic.
  • Highlight Golem's flexible architecture and efficient integration with SMT solvers.
  • Evaluate the performance of Golem and its TPA model-checking algorithm.

Main Methods:

  • Developed Golem with a modular architecture and multiple back-end model-checking algorithms.
  • Integrated Golem tightly with an underlying Satisfiability Modulo Theories (SMT) solver.
  • Implemented the TPA algorithm for deep exploration within Golem's back-end engines.

Main Results:

  • Golem demonstrates flexibility through its modular design and multiple back-end options.
  • Efficient performance is achieved via tight integration with the SMT solver.
  • Extensive evaluations show Golem's competitive capabilities against existing solvers.

Conclusions:

  • Golem offers a flexible and efficient solution for CHC satisfiability over linear arithmetic.
  • The TPA algorithm contributes to Golem's effectiveness in deep exploration tasks.
  • Golem presents a competitive tool for various program and system verification applications.