Automatic verification of reduction techniques in higher order logic (Q469363): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: InVeSt / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ACL2 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ML / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MDGs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Uppaal / 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/s00165-012-0223-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007666139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the non-termination of MDG-based abstract state enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Bit-Vector Arithmetic with Abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the OBDD algorithm for the ATP community / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational Abstractions for Reducing the State Space of Rewrite Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs (MDGs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational abstractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking for real-time systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037380 / rank
 
Normal rank

Latest revision as of 06:15, 9 July 2024

scientific article
Language Label Description Also known as
English
Automatic verification of reduction techniques in higher order logic
scientific article

    Statements

    Automatic verification of reduction techniques in higher order logic (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2014
    0 references
    HOL theorem prover
    0 references
    multiway decision graphs
    0 references
    reduction techniques
    0 references
    soundness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references