Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006) (Q2461559): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TVOC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SMT-LIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Boogie / 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/s10703-007-0038-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034301067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150299 / rank
 
Normal rank

Latest revision as of 12:37, 27 June 2024

scientific article
Language Label Description Also known as
English
Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
scientific article

    Statements

    Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006) (English)
    0 references
    0 references
    0 references
    0 references
    28 November 2007
    0 references
    Automated theorem proving
    0 references
    Decision procedures
    0 references
    Competition
    0 references
    Satisfiability modulo theories
    0 references
    SMT
    0 references
    0 references
    0 references
    0 references

    Identifiers