On the public citation graph

MONA 1.x: New techniques for WS1S and WS2S

0 signed · 62 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/3-540-61648-9_56openalex-snapshot

Mona: Decidable arithmetic in practice

inferredcites →https://doi.org/10.1007/3-540-63174-7_5openalex-snapshot

Implementing WS1S via finite automata

inferredcites →https://doi.org/10.1007/bfb0028022openalex-snapshot

Mona & Fido: The logic-automaton connection in practice

inferredcites →https://doi.org/10.1007/bfb0035388openalex-snapshot

Mosel: A flexible toolset for monadic second-order logic

inferredcites →https://doi.org/10.1145/258915.258936openalex-snapshot

Automatic verification of pointer programs using monadic second-order logic

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11513988_37openalex-snapshot

Verification of Tree Updates for Optimization

inferred← citeshttps://doi.org/10.1007/11817963_6openalex-snapshot

Safraless Compositional Synthesis

inferred← citeshttps://doi.org/10.1007/3-540-36126-x_11openalex-snapshot

Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods

inferred← citeshttps://doi.org/10.1007/3-540-44674-5_15openalex-snapshot

MONA Implementation Secrets

inferred← citeshttps://doi.org/10.1007/3-540-44802-0_27openalex-snapshot

Decision Procedure for an Extension of WS1S

inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot

Branching vs. Linear Time: Final Showdown

inferred← citeshttps://doi.org/10.1007/3-540-45614-7_1openalex-snapshot

Little Engines of Proof

inferred← citeshttps://doi.org/10.1007/3-540-45739-9_7openalex-snapshot

An Overview of Formal Verification for the Time-Triggered Architecture

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-49116-3_43openalex-snapshot

The Weakness of Self-Complementation

inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_50openalex-snapshot

Cellular Automata, Classification of

inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_21openalex-snapshot

Cellular Automata, Classification of

inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_50openalex-snapshot

Classification of Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_7openalex-snapshot

Simulation Algorithms for Symbolic Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_18openalex-snapshot

Automata Terms in a Lazy WSkS Decision Procedure

inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_3openalex-snapshot

Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_17openalex-snapshot

On Complementation of Nondeterministic Finite Automata Without Full Determinization

inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_14openalex-snapshot

Complementation Constructions for Nondeterministic Automata on Infinite Words

inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_22openalex-snapshot

On Verifying Fault Tolerance of Distributed Protocols

inferred← citeshttps://doi.org/10.1007/978-3-642-02734-5_8openalex-snapshot

Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall

inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_13openalex-snapshot

The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey

inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_18openalex-snapshot

Synthesis of Trigger Properties

inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_8openalex-snapshot

Recent Challenges and Ideas in Temporal Synthesis

inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_12openalex-snapshot

Synthesis from Component Libraries with Costs

inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_59openalex-snapshot

Nested Antichains for WS1S

inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_24openalex-snapshot

Lazy Automata Techniques for WS1S

inferred← citeshttps://doi.org/10.1007/s00236-018-0331-zopenalex-snapshot

Nested antichains for WS1S

inferred← citeshttps://doi.org/10.1007/s10703-013-0187-3openalex-snapshot

Verification and enforcement of access control policies

inferred← citeshttps://doi.org/10.1007/s10817-021-09597-wopenalex-snapshot

Automata Terms in a Lazy WSkS Decision Procedure

inferred← citeshttps://doi.org/10.1007/s10990-005-7007-4openalex-snapshot

Relativizations for the Logic-Automata Connection

inferred← citeshttps://doi.org/10.1016/j.jss.2018.12.016openalex-snapshot

Continuously analyzing finite, message-driven, time-synchronous component & connector systems during architecture evolution

inferred← citeshttps://doi.org/10.1016/j.scico.2010.07.004openalex-snapshot

Automated verification of shape, size and bag properties via user-defined predicates in separation logic

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.001openalex-snapshot

Synthesis from component libraries with costs

inferred← citeshttps://doi.org/10.1017/s0956796815000246openalex-snapshot

Verified decision procedures for MSO on words based on derivatives of regular expressions

inferred← citeshttps://doi.org/10.1109/lics.2002.1029829openalex-snapshot

Tree extension algebras: logics, automata, and query languages

inferred← citeshttps://doi.org/10.1109/lics.2003.1210077openalex-snapshot

Model-checking trace event structures

inferred← citeshttps://doi.org/10.1109/sfcs.2005.66openalex-snapshot

Safraless Decision Procedures

inferred← citeshttps://doi.org/10.1109/tse.2016.2589242openalex-snapshot

DECAF: A Platform-Neutral Whole-System Dynamic Binary Analysis Platform

inferred← citeshttps://doi.org/10.1145/1133651.1133652openalex-snapshot

Type inference for unique pattern matching

inferred← citeshttps://doi.org/10.1145/1227839.1227843openalex-snapshot

Logical definability and query languages over ranked and unranked trees

inferred← citeshttps://doi.org/10.1145/1341771.1341775openalex-snapshot

SPKI/SDSI certificate chain discovery with generic constraints

inferred← citeshttps://doi.org/10.1145/1592434.1592437openalex-snapshot

Automated deduction for verification

inferred← citeshttps://doi.org/10.1145/1721837.1721844openalex-snapshot

Reasoning about online algorithms with weighted automata

inferred← citeshttps://doi.org/10.1145/2500365.2500612openalex-snapshot

Verified decision procedures for MSO on words based on derivatives of regular expressions

inferred← citeshttps://doi.org/10.1145/2858784openalex-snapshot

Complexity Hierarchies beyond Elementary

inferred← citeshttps://doi.org/10.1145/2951860.2951873openalex-snapshot

Decidability in Parameterized Verification

inferred← citeshttps://doi.org/10.1145/3437801.3441617openalex-snapshot

Reasoning about recursive tree traversals

inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16809openalex-snapshot

On-the-fly Synthesis for LTL over Finite Traces

inferred← citeshttps://doi.org/10.21236/ada412984openalex-snapshot

Survivable Loosely Coupled Architectures

inferred← citeshttps://doi.org/10.48550/arxiv.1112.6275openalex-snapshot

Reasoning About Strategies: On the Model-Checking Problem

inferred← citeshttps://doi.org/10.48550/arxiv.1408.5690openalex-snapshot

From Software Architecture Structure and Behavior Modeling to Implementations of Cyber-Physical Systems

inferred← citeshttps://doi.org/10.48550/arxiv.1807.08487openalex-snapshot

Simulation Algorithms for Symbolic Automata (Technical Report)

inferred← citeshttps://doi.org/10.5555/1496770.1496861openalex-snapshot

Reasoning about online algorithms with weighted automata

inferred← citeshttps://doi.org/10.65109/zkug1699openalex-snapshot

Nash Equilibria in Finite-Horizon Multiagent Concurrent Games

inferred← citeshttps://doi.org/10.70675/0403fec7z6d88z4f5czb5d8z53294519fb37openalex-snapshot

Automated reasoning on trees with cardinality constraints

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.