SAT-solving in CSP trace refinement (Q436423): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NuSMV / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Casper / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FDR2 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MAGIC / rank
 
Normal rank
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: PicoSAT / 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.1016/j.scico.2011.07.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104703296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent software verification with states, events, and deadlocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communicating Sequential Processes. The First 25 Years / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An attack on the Needham-Schroeder public-key authentication protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded Non-determinism in CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressiveness of CSP with priority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754108 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:33, 5 July 2024

scientific article
Language Label Description Also known as
English
SAT-solving in CSP trace refinement
scientific article

    Statements

    SAT-solving in CSP trace refinement (English)
    0 references
    0 references
    0 references
    0 references
    20 July 2012
    0 references
    CSP
    0 references
    FDR
    0 references
    concurrency
    0 references
    process algebra
    0 references
    SAT-solving
    0 references
    bounded model checking
    0 references
    \(k\)-induction
    0 references
    safety properties
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers