On the public citation graph

LISA: A specification language based on WS2S

https://doi.org/10.1007/bfb0028005
0 signed · 27 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-59293-8_237openalex-snapshot
STeP: The Stanford Temporal Prover
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-60915-6_6openalex-snapshot
An automata-theoretic approach to linear temporal logic
inferredcites →https://doi.org/10.1007/3-540-61511-3_91openalex-snapshot
An improved lower bound for the elementary theories of trees
inferredcites →https://doi.org/10.1007/3-540-63166-6_41openalex-snapshot
Symbolic model checking with rich assertional languages
inferredcites →https://doi.org/10.1007/bf01691346openalex-snapshot
Generalized finite automata theory with an application to a decision problem of second-order logic
inferredcites →https://doi.org/10.1007/bfb0024435openalex-snapshot
A case study in verification based on trace abstractions
inferredcites →https://doi.org/10.1007/bfb0028005openalex-snapshot
LISA: A specification language based on WS2S
inferredcites →https://doi.org/10.1007/bfb0035388openalex-snapshot
Mosel: A flexible toolset for monadic second-order logic
inferredcites →https://doi.org/10.1016/0304-3975(80)90069-9openalex-snapshot
On equations for regular languages, finite automata, and sequential networks
inferredcites →https://doi.org/10.1016/0304-3975(85)90077-5openalex-snapshot
Alternating tree automata
inferredcites →https://doi.org/10.1016/0304-3975(94)90209-7openalex-snapshot
A feature constraint system for logic programming with entailment
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1109/focs.1961.13openalex-snapshot
Delayed-logic and finite-state machines
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.3115/981574.981600openalex-snapshot
A complete and recursive feature theory

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-46419-0_15openalex-snapshot
FMona: A Tool for Expressing Validation Techniques over Infinite State Systems
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_8openalex-snapshot
Compile-Time Debugging of C Programs Working on Trees
inferred← citeshttps://doi.org/10.1007/3-540-48975-4_6openalex-snapshot
The MSO Logic-Automaton Connection in Linguistics
inferred← citeshttps://doi.org/10.1109/32.798326openalex-snapshot
A domain-specific language for regular sets of strings and trees
inferred← citeshttps://doi.org/10.1109/hldvt.2006.319978openalex-snapshot
MMV: Metamodeling Based Microprocessor Valiation Environment
inferred← citeshttps://doi.org/10.1109/ismvl.1999.779709openalex-snapshot
Structural and behavioral modeling with monadic logics
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.917419openalex-snapshot
MMV: A Metamodeling Based Microprocessor Validation Environment
inferred← citeshttps://doi.org/10.3115/976909.979677openalex-snapshot
Representing constraints with automata
inferred← citeshttps://doi.org/10.7146/brics.v7i40.20206openalex-snapshot
MONA Implementation Secrets
showing the first 9 of 10 · page through all 10
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.