A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (Q831915): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3202430163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refutational theorem proving for hierarchic first-order theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchic superposition revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn Clause Solvers for Program Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sledgehammer: Judgement Day / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding the Bernays-Schoenfinkel fragment over bounded difference constraints by simple clause learning over theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPASS-SATT. A CDCL(LA) solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal invariant checking of parametric systems with quantifier-free SMT reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCL clause learning from simple models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superposition for Bounded Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combination of the Bernays-Schönfinkel-Ramsey fragment with simple linear integer arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for classes of quantificational formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Linear Quantifier Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and related enhancements for automated theorem-proving programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete problems in the first-order predicate calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the verification of security-aware E-services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting enumerative instantiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster, higher, stronger: E 2.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient model construction for Horn logic with VLog (system description) / rank
 
Normal rank

Latest revision as of 10:43, 28 July 2024

scientific article
Language Label Description Also known as
English
A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic
scientific article

    Statements

    A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers