On the public citation graph

Mosel: A flexible toolset for monadic second-order logic

0 signed · 58 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.1002/malq.19600060105openalex-snapshot
Weak Second‐Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/3-540-60045-0_38openalex-snapshot
Hardware verification using monadic second-order logic
inferredcites →https://doi.org/10.1007/3-540-60630-0_5openalex-snapshot
Mona: Monadic second-order logic in practice
inferredcites →https://doi.org/10.1007/3-540-61042-1_49openalex-snapshot
Fully automatic verification and error detection for parameterized iterative sequential circuits
inferredcites →https://doi.org/10.1007/3-540-61474-5_100openalex-snapshot
The METAFrame'95 environment
inferredcites →https://doi.org/10.1007/3-540-61474-5_92openalex-snapshot
STeP: Deductive-algorithmic verification of reactive and real-time systems
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot
Weak Second-Order Arithmetic and Finite Automata
inferredcites →https://doi.org/10.1007/bfb0024435openalex-snapshot
A case study in verification based on trace abstractions
inferredcites →https://doi.org/10.1007/bfb0035384openalex-snapshot
Graphs in MetaFrame: The unifying power of polymorphism
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1109/lics.1990.113767openalex-snapshot
Symbolic model checking: 10/sup 20/ states and beyond
inferredcites →https://doi.org/10.1109/tc.1978.1675141openalex-snapshot
Binary Decision Diagrams
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.2307/2270398openalex-snapshot
Alonzo Church. Logic, arithmetic, and automata. Proceedings of the International Congress of Mathematicians, 15–22 August 1962, Institut Mittag-Leffler, Djursholm, Sweden, 1963, pp. 23–35.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722167_31openalex-snapshot
Regular Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44674-5_15openalex-snapshot
MONA Implementation Secrets
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_9openalex-snapshot
Regular Model Checking Made Simple and Effcient*
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_16openalex-snapshot
Transitive Closures of Regular Relations for Verifying Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_26openalex-snapshot
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_35openalex-snapshot
A Theory of Restrictions for Logics and Automata
inferred← citeshttps://doi.org/10.1007/3-540-48975-4_6openalex-snapshot
The MSO Logic-Automaton Connection in Linguistics
inferred← citeshttps://doi.org/10.1007/3-540-49519-3_30openalex-snapshot
Techniques for Implicit State Enumeration of EFSMs
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_45openalex-snapshot
Mosel: A sound and efficient tool for M2L(Str)
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_6openalex-snapshot
Formalizing requirements for distributed systems with trace diagrams
inferred← citeshttps://doi.org/10.1007/978-3-031-73741-1_15openalex-snapshot
Model Driven Development for AI-Based Healthcare Systems: A Review
inferred← citeshttps://doi.org/10.1007/978-3-031-73887-6_1openalex-snapshot
The Combined Power of Research, Education and Dissemination
inferred← citeshttps://doi.org/10.1007/978-3-031-73887-6_17openalex-snapshot
A Modal Logic Analysis of the MUTEX Variable Coverage Theorem
inferred← citeshttps://doi.org/10.1007/978-3-031-73887-6_4openalex-snapshot
From Otter to ISoLA
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_21openalex-snapshot
Model Checking Parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-47166-2_20openalex-snapshot
Synthesis from a Practical Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_56openalex-snapshot
Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
inferred← citeshttps://doi.org/10.1007/978-3-642-04930-9_25openalex-snapshot
Synthesizing Semantic Web Service Compositions with jMosel and Golog
inferred← citeshttps://doi.org/10.1007/bfb0028005openalex-snapshot
LISA: A specification language based on WS2S
inferred← citeshttps://doi.org/10.1007/bfb0028022openalex-snapshot
Mona & Fido: The logic-automaton connection in practice
inferred← citeshttps://doi.org/10.1007/bfb0028773openalex-snapshot
MONA 1.x: New techniques for WS1S and WS2S
inferred← citeshttps://doi.org/10.1007/bfb0035375openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/bfb0035384openalex-snapshot
Graphs in MetaFrame: The unifying power of polymorphism
inferred← citeshttps://doi.org/10.1007/bfb0053506openalex-snapshot
Formal methods and customized visualization: A fruitful symbiosis
inferred← citeshttps://doi.org/10.1007/bfb0055785openalex-snapshot
A (non-elementary) modular decision procedure for LTrL
inferred← citeshttps://doi.org/10.1007/pl00010806openalex-snapshot
Theorem proving in technology transfer: the user’s point of view
inferred← citeshttps://doi.org/10.1007/s10009-016-0446-xopenalex-snapshot
The physics of software tools: SWOT analysis and vision
inferred← citeshttps://doi.org/10.1007/s10990-005-7007-4openalex-snapshot
Relativizations for the Logic-Automata Connection
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00349-8openalex-snapshot
wMSO theories as grammar formalisms
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80527-4openalex-snapshot
The Electronic Tool Integration Platform as a Supplier and User of Graph Based Tools
inferred← citeshttps://doi.org/10.1142/s0129054109006887openalex-snapshot
MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
inferred← citeshttps://doi.org/10.1186/1471-2105-10-s10-s8openalex-snapshot
Bio-jETI: a framework for semantics-based service composition
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.30.439openalex-snapshot
Second-Order Value Numbering
inferred← citeshttps://doi.org/10.3115/976909.979677openalex-snapshot
Representing constraints with automata
inferred← citeshttps://doi.org/10.3115/979617.979677openalex-snapshot
Representing constraints with automata
inferred← citeshttps://doi.org/10.3115/980432.980752openalex-snapshot
A descriptive characterization of tree-adjoining languages
inferred← citeshttps://doi.org/10.3115/980691.980752openalex-snapshot
A descriptive characterization of tree-adjoining languages
inferred← citeshttps://doi.org/10.48550/arxiv.cmp-lg/9805008openalex-snapshot
A Descriptive Characterization of Tree-Adjoining Languages (Full Version)
inferred← citeshttps://doi.org/10.7146/brics.v7i40.20206openalex-snapshot
MONA Implementation Secrets
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.