On the public citation graph

Characteristic formulae

https://doi.org/10.1007/bfb0035794
0 signed · 70 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-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferredcites →https://doi.org/10.1007/3-540-52148-8_3openalex-snapshot
The concurrency workbench
inferredcites →https://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferredcites →https://doi.org/10.1007/bfb0035794openalex-snapshot
Characteristic formulae
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(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferredcites →https://doi.org/10.1016/b978-0-934613-04-0.50032-6openalex-snapshot
A Framework for Intuitionistic Modal Logics
inferredcites →https://doi.org/10.1016/s0019-9958(86)80031-6openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.1145/800135.804410openalex-snapshot
On the expressive power of Dynamic Logic (Preliminary Report)
inferredcites →https://doi.org/10.21236/ada188743openalex-snapshot
Reasoning about Networks with Many Identical Finite-State Processes.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11787006_31openalex-snapshot
Descriptive and Relative Completeness of Logics for Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_144openalex-snapshot
Local model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_19openalex-snapshot
Modal specifications
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_3openalex-snapshot
The concurrency workbench
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_129openalex-snapshot
Computing behavioural relations, logically
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_54openalex-snapshot
Data flow analysis as model checking
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_6openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_32openalex-snapshot
Faster model checking for the modal Mu-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_37openalex-snapshot
An expressive logic for Basic Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_18openalex-snapshot
Model construction for implicit specifications in modal logic
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_6openalex-snapshot
The fixpoint-analysis machine
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_158openalex-snapshot
From timed automata to logic — and back
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_2openalex-snapshot
A constraint oriented proof methodology based on modal transition systems
inferred← citeshttps://doi.org/10.1007/3-540-61739-6_31openalex-snapshot
Property-oriented expansion
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_12openalex-snapshot
Predicate Abstraction and Such...
inferred← citeshttps://doi.org/10.1007/978-3-030-30923-7_1openalex-snapshot
Model Verification Through Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-31514-6_8openalex-snapshot
Generating Hard Benchmark Problems for Weak Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-031-08143-9_9openalex-snapshot
A Model of Actors and Grey Failures
inferred← citeshttps://doi.org/10.1007/978-3-032-12484-5_7openalex-snapshot
Formal Methods Meet AI Guidance for Correct Software Development
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_32openalex-snapshot
Process Algebra and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_7openalex-snapshot
Property-Preserving Parallel Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_38openalex-snapshot
jETI: A Tool for Remote Tool Integration
inferred← citeshttps://doi.org/10.1007/978-3-642-35887-6_4openalex-snapshot
Synthesis-Based Variability Control: Correctness by Construction
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_21openalex-snapshot
Property-Driven Benchmark Generation
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_52openalex-snapshot
Characteristic Formulae for Session Types
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_20openalex-snapshot
Model Checking ACTL Constrained Processes
inferred← citeshttps://doi.org/10.1007/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferred← citeshttps://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferred← citeshttps://doi.org/10.1007/bfb0023732openalex-snapshot
Compositional minimization of finite state systems
inferred← citeshttps://doi.org/10.1007/bfb0039057openalex-snapshot
A preorder for partial process specifications
inferred← citeshttps://doi.org/10.1007/s00236-020-00376-5openalex-snapshot
Characteristic invariants in Hennessy–Milner logic
inferred← citeshttps://doi.org/10.1007/s10009-014-0321-6openalex-snapshot
Risk-based testing via active continuous quality control
inferred← citeshttps://doi.org/10.1007/s10009-014-0336-zopenalex-snapshot
Property-driven benchmark generation: synthesizing programs of realistic structure
inferred← citeshttps://doi.org/10.1007/s10009-014-0339-9openalex-snapshot
Tailored generation of concurrent benchmarks
inferred← citeshttps://doi.org/10.1007/s10009-020-00578-9openalex-snapshot
Dependency graphs with applications to verification
inferred← citeshttps://doi.org/10.1007/s10009-024-00746-1openalex-snapshot
Rance Cleaveland: a life for formal methods
inferred← citeshttps://doi.org/10.1016/0167-6423(93)90003-8openalex-snapshot
Generating data flow analysis algorithms from modal specifications
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90110-4openalex-snapshot
Local model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.077openalex-snapshot
Enhancing Test Coverage by Back-tracing Model-checker Counterexamples
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.007openalex-snapshot
Complete proof systems for weighted modal logic
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00104-0openalex-snapshot
Reasoning about nondeterministic and concurrent actions: A process algebra approach
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80257-9openalex-snapshot
Derivation of Characteristic Formulae
inferred← citeshttps://doi.org/10.1023/b:logi.0000036771.59434.71openalex-snapshot
On Modal μ-Calculus and Non-Well-Founded Set Theory
inferred← citeshttps://doi.org/10.1109/acsd.2017.24openalex-snapshot
Property-Preserving Generation of Tailored Benchmark Petri Nets
inferred← citeshttps://doi.org/10.1109/confluence.2019.8776962openalex-snapshot
A Model-driven Approach to Continuous Practices for Modern Cloud-based Web Applications
inferred← citeshttps://doi.org/10.1109/ecbs.2005.59openalex-snapshot
Remote Integration and Coordination of Verification Tools in JETI
inferred← citeshttps://doi.org/10.1109/isola.2006.71openalex-snapshot
Connecting Algebraic and Logical Descriptions of Concurrent Systems
inferred← citeshttps://doi.org/10.1109/lics.1990.113738openalex-snapshot
Equation solving using modal transition systems
inferred← citeshttps://doi.org/10.1109/lics.1994.316075openalex-snapshot
On the parallel complexity of model checking in the modal mu-calculus
inferred← citeshttps://doi.org/10.1109/quatic.2010.53openalex-snapshot
Synthesis-Based Loose Programming
inferred← citeshttps://doi.org/10.1145/151646.151648openalex-snapshot
The concurrency workbench
inferred← citeshttps://doi.org/10.1145/2465449.2465469openalex-snapshot
Active continuous quality control
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:13)2023openalex-snapshot
A model of actors and grey failures
inferred← citeshttps://doi.org/10.48550/arxiv.1510.06879openalex-snapshot
Characteristic Formulae for Session Types (extended version)
inferred← citeshttps://doi.org/10.54337/aau510736584openalex-snapshot
Abstract Dependency Graphs for Model Verification
inferred← citeshttps://doi.org/10.7146/brics.v2i2.19504openalex-snapshot
From Timed Automata to Logic - and Back
inferred← citeshttps://doi.org/10.7146/dpb.v21i417.6730openalex-snapshot
Design, analysis and Reasoning about Tools: Abstracts from the Second Workshop (Aalborg, 1992, 20-21 August)
inferred← citeshttps://doi.org/10.7146/dpb.v22i457.6930openalex-snapshot
Design, Analysis and Reasoning about Tools: Abstracts from the Third Workshop
showing the first 58 of 59 · page through all 59
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.