On the public citation graph

3-Valued Abstraction: More Precision at Less Cost

0 signed · 49 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11513988_7openalex-snapshot
Concrete Model Checking with Abstract Matching and Refinement
inferredcites →https://doi.org/10.1007/11609773_25openalex-snapshot
Systematic Construction of Abstractions for Model-Checking
inferredcites →https://doi.org/10.1007/11924661_12openalex-snapshot
Comparing Completeness Properties of Static Analyses and Their Logics
inferredcites →https://doi.org/10.1007/3-540-36384-x_18openalex-snapshot
On the Expressiveness of 3-Valued Models
inferredcites →https://doi.org/10.1007/3-540-44618-4_14openalex-snapshot
Generalized Model Checking: Reasoning about Partial State Spaces
inferredcites →https://doi.org/10.1007/3-540-44685-0_29openalex-snapshot
Abstraction-Based Model Checking Using Modal Transition Systems
inferredcites →https://doi.org/10.1007/3-540-45309-1_11openalex-snapshot
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
inferredcites →https://doi.org/10.1007/3-540-45657-0_11openalex-snapshot
Automatic Abstraction Using Generalized Model Checking
inferredcites →https://doi.org/10.1007/3-540-47764-0_20openalex-snapshot
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
inferredcites →https://doi.org/10.1007/3-540-48683-6_25openalex-snapshot
Model Checking Partial State Spaces with 3-Valued Temporal Logics
inferredcites →https://doi.org/10.1007/3-540-52148-8_19openalex-snapshot
Modal specifications
inferredcites →https://doi.org/10.1007/3-540-55844-6_142openalex-snapshot
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
inferredcites →https://doi.org/10.1007/3-540-60360-3_32openalex-snapshot
Optimality in abstractions of model checking
inferredcites →https://doi.org/10.1007/978-3-540-24725-8_3openalex-snapshot
Strong Preservation as Completeness in Abstract Interpretation
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_5openalex-snapshot
Closed and Logical Relations for Over- and Under-Approximation of Powersets
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_28openalex-snapshot
A Game-Based Framework for CTL Counterexamples and 3-Valued Abstraction-Refinement
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_29openalex-snapshot
Abstraction for Branching Time Properties
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferredcites →https://doi.org/10.1109/lics.1988.5119openalex-snapshot
A modal process logic
inferredcites →https://doi.org/10.1109/lics.1990.113738openalex-snapshot
Equation solving using modal transition systems
inferredcites →https://doi.org/10.1109/lics.2004.1319611openalex-snapshot
Three-valued abstractions of games: uncertainty, but with precision
inferredcites →https://doi.org/10.1109/lics.2004.1319628openalex-snapshot
The existence of finite abstractions for branching time model checking
inferredcites →https://doi.org/10.1109/lics.2004.42openalex-snapshot
The existence of finite abstractions for branching time model checking
inferredcites →https://doi.org/10.1145/244795.244800openalex-snapshot
Abstract interpretation of reactive systems
inferredcites →https://doi.org/10.1145/333979.333989openalex-snapshot
Making abstract interpretations complete
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11823230_9openalex-snapshot
Underapproximating Predicate Transformers
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_12openalex-snapshot
More Precise Partition Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_3openalex-snapshot
Local Abstraction-Refinement for the mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_5openalex-snapshot
Compositional Verification and 3-Valued Abstractions Join Forces
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_6openalex-snapshot
Solving Games Via Three-Valued Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-85114-1_9openalex-snapshot
State Focusing: Lazy Abstraction for the Mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-93900-9_28openalex-snapshot
Mixed Transition Systems Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-01702-5_9openalex-snapshot
A Uniform Approach to Three-Valued Semantics for μ-Calculus on Abstractions of Hybrid Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_16openalex-snapshot
On the Expressiveness of Refinement Settings
inferred← citeshttps://doi.org/10.1007/s10009-010-0161-yopenalex-snapshot
A uniform approach to three-valued semantics for μ-calculus on abstractions of hybrid automata
inferred← citeshttps://doi.org/10.1007/s10009-011-0202-1openalex-snapshot
Local abstraction–refinement for the μ-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.08.016openalex-snapshot
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.08.006openalex-snapshot
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
inferred← citeshttps://doi.org/10.1016/j.ic.2008.07.004openalex-snapshot
3-Valued abstraction: More precision at less cost
inferred← citeshttps://doi.org/10.1016/j.ic.2009.05.007openalex-snapshot
Solving games via three-valued abstraction refinement
inferred← citeshttps://doi.org/10.1016/j.ic.2009.10.002openalex-snapshot
Compositional verification and 3-valued abstractions join forces
inferred← citeshttps://doi.org/10.1016/j.ic.2010.08.001openalex-snapshot
On the consistency, expressiveness, and precision of partial modeling formalisms
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.05.003openalex-snapshot
Comparing disjunctive modal transition systems with an one-selecting variant
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.002openalex-snapshot
Inverse-limit and topological aspects of abstract interpretation
inferred← citeshttps://doi.org/10.1109/tase.2014.18openalex-snapshot
Mixed Simulation of Multi-valued Models
inferred← citeshttps://doi.org/10.5287/ora-y0bamqrpdopenalex-snapshot
Automated quantitative software verification
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.