On the public citation graph
Fully local and efficient evaluation of alternating fixed points
0 signed · 71 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-11494-7_22openalex-snapshot
Specification and verification of concurrent systems in CESAR
inferredcites →https://doi.org/10.1007/3-540-56496-9_32openalex-snapshot
Faster model checking for the modal Mu-Calculus
inferredcites →https://doi.org/10.1007/3-540-58179-0_66openalex-snapshot
An improved algorithm for the evaluation of fixpoint expressions
inferredcites →https://doi.org/10.1007/3-540-58179-0_67openalex-snapshot
Incremental model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/3-540-58201-0_77openalex-snapshot
Efficient local correctness checking for single and alternating boolean equation systems
inferredcites →https://doi.org/10.1007/3-540-60218-6_6openalex-snapshot
The fixpoint-analysis machine
inferredcites →https://doi.org/10.1007/3-540-61042-1_41openalex-snapshot
Efficient local model-checking for fragments of the modal Μ-calculus
inferredcites →https://doi.org/10.1007/3-540-61511-3_98openalex-snapshot
An abstract machine for fixed-order dynamically stratified programs
inferredcites →https://doi.org/10.1007/3-540-63141-0_2openalex-snapshot
Partial-order reduction in the weak modal mu-calculus
inferredcites →https://doi.org/10.1007/3-540-63166-6_16openalex-snapshot
Efficient model checking using tabled resolution
inferredcites →https://doi.org/10.1007/978-3-540-69850-0_12openalex-snapshot
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
inferredcites →https://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1007/bfb0035797openalex-snapshot
A note on model checking the modal v-calculus
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1016/0304-3975(91)90043-2openalex-snapshot
A note on model checking the modal ν-calculus
inferredcites →https://doi.org/10.1016/0304-3975(94)90266-6openalex-snapshot
Model checking and boolean graphs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1996.561358openalex-snapshot
Efficient model checking via the equational μ-calculus
inferredcites →https://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.25405/ncl.34123050openalex-snapshot
Formal Methods: State of the Art and Future Directions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10720327_3openalex-snapshot
Constraint Logic Programming Applied to Model Checking
inferred← citeshttps://doi.org/10.1007/10720327_5openalex-snapshot
Infinite State Model Checking by Abstract Interpretation and Program Specialisation
inferred← citeshttps://doi.org/10.1007/11415763_9openalex-snapshot
Solving Alternating Boolean Equation Systems in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/11562931_23openalex-snapshot
Deductive Multi-valued Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-45635-x_23openalex-snapshot
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_37openalex-snapshot
Evidence-Based Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_20openalex-snapshot
Local Model-Checking of Modal Mu-Calculus on Acyclic Labeled Transition Systems
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_18openalex-snapshot
Efficient Diagnostic Generation for Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_24openalex-snapshot
Small Progress Measures for Solving Parity Games
inferred← citeshttps://doi.org/10.1007/3-540-49201-1_21openalex-snapshot
Developing a Declarative Rule Language for Applications in Product Configuration
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_18openalex-snapshot
Abstract Dependency Graphs and Their Application to Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-031-01561-8openalex-snapshot
Answer Set Solving in Practice
inferred← citeshttps://doi.org/10.1007/978-3-031-32157-3_9openalex-snapshot
Elimination of Detached Regions in Dependency Graph Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_5openalex-snapshot
Two Decades of Industrializing Formal Verification: The Reactis Story
inferred← citeshttps://doi.org/10.1007/978-3-319-47677-3_13openalex-snapshot
Distributed Computation of Fixed Points on Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_33openalex-snapshot
Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_4openalex-snapshot
Coinductive Logic Programming and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_10openalex-snapshot
Computing Weakest Strategies for Safety Games of Imperfect Information
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_12openalex-snapshot
Local Model Checking of Weighted CTL with Upper-Bound Constraints
inferred← citeshttps://doi.org/10.1007/bf02960756openalex-snapshot
A graphical μ-calculus and local model checking
inferred← citeshttps://doi.org/10.1007/bfb0055040openalex-snapshot
Simple linear-time algorithms for minimal fixed points
inferred← citeshttps://doi.org/10.1007/bfb0056604openalex-snapshot
Logic programming and model checking
inferred← citeshttps://doi.org/10.1007/s10009-005-0194-9openalex-snapshot
CAESAR_SOLVE: A generic library for on-the-fly resolution of alternation-free Boolean equation systems
inferred← citeshttps://doi.org/10.1007/s10009-014-0359-5openalex-snapshot
Efficient model-checking of weighted CTL with upper-bound constraints
inferred← citeshttps://doi.org/10.1007/s10009-021-00638-8openalex-snapshot
Extended abstract dependency graphs
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50022-9openalex-snapshot
Modal Logics and mu-Calculi: An Introduction
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.064openalex-snapshot
Obtaining Memory-Efficient Solutions to Boolean Equation Systems
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00187-xopenalex-snapshot
Extending and implementing the stable model semantics
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00094-1openalex-snapshot
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00341-2openalex-snapshot
The limits of fixed-order computation
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00005-4openalex-snapshot
An abstract machine for efficiently computing queries to well-founded models
inferred← citeshttps://doi.org/10.1017/s1471068410000293openalex-snapshot
FO(FD): Extending classical logic with rule-based fixpoint definitions
inferred← citeshttps://doi.org/10.1023/a:1018930122475openalex-snapshot
Logic programs with stable model semantics as a constraint programming paradigm
inferred← citeshttps://doi.org/10.1023/a:1018990308362openalex-snapshot
Tabling for non‐monotonic programming
inferred← citeshttps://doi.org/10.1109/real.2000.896007openalex-snapshot
Tabled resolution + constraints: a recipe for model checking real-time systems
inferred← citeshttps://doi.org/10.1145/1119439.1119440openalex-snapshot
Unfolding partiality and disjunctions in stable model semantics
inferred← citeshttps://doi.org/10.1145/1970398.1970401openalex-snapshot
Logic programs with propositional connectives and aggregates
inferred← citeshttps://doi.org/10.1145/2071368.2071376openalex-snapshot
Structural Analysis of Boolean Equation Systems
inferred← citeshttps://doi.org/10.2200/s00457ed1v01y201211aim019openalex-snapshot
Answer Set Solving in Practice
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2011.51openalex-snapshot
Representing the Language of the Causal Calculator in Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0003033openalex-snapshot
Smodels: A System for Answer Set Programming
inferred← citeshttps://doi.org/10.54337/aau510736584openalex-snapshot
Abstract Dependency Graphs for Model Verification
inferred← citeshttps://doi.org/10.6100/ir757862openalex-snapshot
Advanced reduction techniques for model checking
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.