A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.ic.2016.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2264857910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Assume-Guarantee Reasoning by Abstraction Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized L*-Based Assume-Guarantee Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4806210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Minimal Separating DFA’s for Compositional Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3604278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refining Interface Alphabets for Compositional Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated assumption generation for compositional verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2003 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latticed Simulation Relations and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Methodology and Software Technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic symbolic compositional verification by learning assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Technology for Verification and Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositional Verification and 3-Valued Abstractions Join Forces / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Compositional Verification Using Lazy Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:21, 11 July 2024

scientific article
Language Label Description Also known as
English
A framework for compositional verification of multi-valued systems via abstraction-refinement
scientific article

    Statements

    A framework for compositional verification of multi-valued systems via abstraction-refinement (English)
    0 references
    0 references
    0 references
    0 references
    10 March 2016
    0 references
    0 references
    multi-valued model checking
    0 references
    mu-calculus
    0 references
    bilattices
    0 references
    mixed simulation
    0 references
    refinement
    0 references
    compositional model checking
    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