Horn Clause Solvers for Program Verification (Q2947164): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ESC/Java / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HMC / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-23534-9_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2293809538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Booster: An Acceleration-Based Verification Framework for Array Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resourceful Reachability as HORN-LA / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint-based approach to solving games on infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property Directed Polyhedral Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inadequacy of computable loop invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Model Checking without Unrolling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Transformation System for Developing Recursive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soundness and Completeness of an Axiom System for Program Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterization theorems for infinitary universal Horn logic without equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superposition as a decision procedure for timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4997236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about procedures as parameters in the language L4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Recursive Programs with Exact Predicate Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of Ciao and its design philosophy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Property Directed Reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sentences which are true of direct unions of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property-directed inference of universal invariants or proving their absence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient weakest preconditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal Verification of Reactive Systems: Response / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, convexity and combinations of theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation Logic Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis and transformation of logic programs using unfold/fold proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-directed abstraction refinement approach to higher-order model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise interprocedural dataflow analysis with applications to constant propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-level liquid types / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concept of a supercompiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank

Latest revision as of 19:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Horn Clause Solvers for Program Verification
scientific article

    Statements

    Horn Clause Solvers for Program Verification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 September 2015
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references