Bounded model checking of infinite state systems (Q2369883): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BerkMin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CESAR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Esterel / 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-006-0019-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2003378122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache behavior prediction by abstract interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4024005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local model checking for infinite state spaces / 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: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for race analysis of asynchronous networks / 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: Q2760246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableau-based model checking in the propositional mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BerkMin: A fast and robust SAT-solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decision Problem for Two-Variable First-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preservation Theorems for Two-Variable Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5812175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems forω-automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4388806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On languages with two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic proof technique for parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient manipulation of decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local model checking in the modal mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ω-regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal logic can be more expressive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518891 / rank
 
Normal rank

Latest revision as of 10:20, 26 June 2024

scientific article
Language Label Description Also known as
English
Bounded model checking of infinite state systems
scientific article

    Statements

    Bounded model checking of infinite state systems (English)
    0 references
    0 references
    0 references
    21 June 2007
    0 references
    0 references
    Bounded model checking
    0 references
    Infinite state systems
    0 references
    Temporal logic hierarchy
    0 references
    Global model checking
    0 references
    Local 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references