Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127871360, #quickstatements; #temporary_batch_1723667127323
 
(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.1007/s00165-019-00483-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2945420580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof System for Communicating Sequential Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter reachability criteria for deadlock-freedom analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Automatic Detection of Token Structures and Invariants Using SAT Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking Static Properties Using Conservative SAT Approximations for Reachability / 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: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deadlock analysis in networks of communicating processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using integer programming to verify general safety and liveness properties / 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: Q5633643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FDR3 — A Modern Refinement Checker for CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using partial orders for the efficient verification of deadlock freedom and safety properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3777424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy Reachability Analysis in Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving the Correctness of Multiprocess Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Component-Based Systems on the Basis of Architectural Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rigorous development of component-based systems using component metadata and patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Analysis of Determinism for CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Static Analysis Framework for Livelock Freedom in CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-solving in CSP trace refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pursuit of deadlock freedom / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding concurrent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking of concurrent software systems via heuristic-guided SAT solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stubborn attack on state explosion / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127871360 / rank
 
Normal rank

Latest revision as of 22:50, 14 August 2024

scientific article
Language Label Description Also known as
English
Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
scientific article

    Statements

    Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (English)
    0 references
    0 references
    0 references
    0 references
    3 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate reachability
    0 references
    local analysis
    0 references
    SAT solving
    0 references
    formal verification
    0 references
    deadlock freedom
    0 references
    model checking
    0 references
    approximate verification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references