On the public citation graph
Model checking for context-free processes
0 signed · 138 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-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
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-54233-7_129openalex-snapshot
Computing behavioural relations, logically
inferredcites →https://doi.org/10.1007/3-540-55179-4_6openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
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/bf00264284openalex-snapshot
Tableau-based model checking in the propositional mu-calculus
inferredcites →https://doi.org/10.1007/bf01383878openalex-snapshot
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
inferredcites →https://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferredcites →https://doi.org/10.1007/bfb0035797openalex-snapshot
A note on model checking the modal v-calculus
inferredcites →https://doi.org/10.1016/0020-0190(92)90142-iopenalex-snapshot
A short proof of the decidability of bisimulation for normed bpa-processes
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(92)90183-gopenalex-snapshot
Local model checking for infinite state spaces
inferredcites →https://doi.org/10.1051/ita/1990240403391openalex-snapshot
Graphes canoniques de graphes algébriques
inferredcites →https://doi.org/10.1109/lics.1991.151661openalex-snapshot
Actions speak louder than words: proving bisimilarity for context-free processes
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/174130.174141openalex-snapshot
Decidability of bisimulation equivalence for process generating context-free languages
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.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1996.0083openalex-snapshot
Undecidable Verification Problems for Programs with Unreliable Channels
inferred← citeshttps://doi.org/10.1007/10722167_7openalex-snapshot
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/10722468_7openalex-snapshot
Bebop: A Symbolic Model Checker for Boolean Programs
inferred← citeshttps://doi.org/10.1007/11821946_1openalex-snapshot
Automatic Checking of Component Protocols in Component-Based Systems
inferred← citeshttps://doi.org/10.1007/11901914_10openalex-snapshot
On the Membership Problem for Visibly Pushdown Languages
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_31openalex-snapshot
Model Checking Linear Properties of Prefix-Recognizable Systems
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_18openalex-snapshot
Demand-Driven Model Checking for Context-Free Processes
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_54openalex-snapshot
Model Checking of Unrestricted Hierarchical State Machines
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_14openalex-snapshot
Model Checking and Higher-Order Recursion
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_2openalex-snapshot
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_22openalex-snapshot
Program Analysis as Model Checking of Abstract Interpretations
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_105openalex-snapshot
Local model checking for context-free processes
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-58179-0_48openalex-snapshot
Verification of context-free timed systems using linear hybrid observers
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_52openalex-snapshot
Model checking of macro processes
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_56openalex-snapshot
Deciding properties of integral relational automata
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_39openalex-snapshot
Verifying safety properties of a class of infinite-state distributed algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_62openalex-snapshot
On the model checking problem for branching time logics and basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_25openalex-snapshot
Decidability of simulation and bisimulation between lossy channel systems and finite state systems
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_6openalex-snapshot
The fixpoint-analysis machine
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_4openalex-snapshot
Decidability results in automata and process theory
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_58openalex-snapshot
Pushdown processes: Games and model checking
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_1openalex-snapshot
Logical and operational methods in the analysis of programs and systems
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_4openalex-snapshot
Abstract interpretation of small-step semantics
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_10openalex-snapshot
Reachability analysis of pushdown automata: Application to model-checking
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_198openalex-snapshot
Model checking the full modal mu-calculus for infinite sequential processes
inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_23openalex-snapshot
Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_16openalex-snapshot
An Improved Search Strategy for Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-00244-2_10openalex-snapshot
Active Mining of Document Type Definitions
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-00244-2_15openalex-snapshot
M3C: Modal Meta Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-03418-4_23openalex-snapshot
Design for ‘X’ Through Model Transformation
inferred← citeshttps://doi.org/10.1007/978-3-030-22348-9_1openalex-snapshot
Models, Mindsets, Meta: The What, the How, and the Why Not?
inferred← citeshttps://doi.org/10.1007/978-3-030-22348-9_8openalex-snapshot
States and Events in KandISTI
inferred← citeshttps://doi.org/10.1007/978-3-030-30985-5_19openalex-snapshot
Product Line Verification via Modal Meta Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-30985-5_20openalex-snapshot
Towards Model Checking Product Lines in the Digital Humanities: An Application to Historical Data
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_3openalex-snapshot
Generative Program Analysis and Beyond: The Power of Domain-Specific Languages (Invited Paper)
inferred← citeshttps://doi.org/10.1007/978-3-030-87348-6_10openalex-snapshot
A Context-Free Symbiosis of Runtime Verification and Automata Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_5openalex-snapshot
Regular Model Checking: Evolution and Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-030-91384-7_9openalex-snapshot
Never-Stop Context-Free Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_19openalex-snapshot
Be Lazy and Don’t Care: Faster CTL Model Checking for Recursive State Machines
inferred← citeshttps://doi.org/10.1007/978-3-031-02334-7openalex-snapshot
Analysis Techniques for Information Security
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_17openalex-snapshot
Model Checking Procedural Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-47169-3_16openalex-snapshot
Meta-Level Reuse for Mastering Domain Specialization
inferred← citeshttps://doi.org/10.1007/978-3-319-94111-0_9openalex-snapshot
A Branching Time Variant of CaRet
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_30openalex-snapshot
Global Model-Checking of Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_8openalex-snapshot
History Effects and Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-30570-5_1openalex-snapshot
Model Checking for Database Theoreticians
inferred← citeshttps://doi.org/10.1007/978-3-540-39910-0_3openalex-snapshot
Formal Analysis of Hierarchical State Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_10openalex-snapshot
Local Model Checking for Parallel Compositions of Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_8openalex-snapshot
Verification of Nonregular Temporal Properties for Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_9openalex-snapshot
Pushdown Processes: Parallel Composition and Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_7openalex-snapshot
Solving Multiple Dataflow Queries Using WPDSs
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_6openalex-snapshot
Model Checking: From Tools to Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_6openalex-snapshot
Complete SAT-Based Model Checking for Context-Free Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-75987-4_12openalex-snapshot
Querying Structural and Behavioral Properties of Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_4openalex-snapshot
Program Analysis Using Weighted Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-87891-9openalex-snapshot
Component-Based Software Engineering
inferred← citeshttps://doi.org/10.1007/978-3-540-87891-9_11openalex-snapshot
Automatic Protocol Conformance Checking of Recursive and Parallel Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_11openalex-snapshot
An Automata-Theoretic Approach to Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-33427-6_9openalex-snapshot
Protocol Conformance Checking of Services with Exceptions
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_16openalex-snapshot
Analysis of Boolean Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-38771-5_35openalex-snapshot
Operator Precedence ω-Languages
inferred← citeshttps://doi.org/10.1007/bfb0084788openalex-snapshot
Bisimulation equivalence is decidable for all context-free processes
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/s00236-020-00376-5openalex-snapshot
Characteristic invariants in Hennessy–Milner logic
inferred← citeshttps://doi.org/10.1007/s002360050074openalex-snapshot
Decidability of model checking for infinite-state concurrent systems
inferred← citeshttps://doi.org/10.1007/s10009-013-0270-5openalex-snapshot
Tools for software verification
inferred← citeshttps://doi.org/10.1007/s10009-013-0297-7openalex-snapshot
Developments in automated verification techniques
inferred← citeshttps://doi.org/10.1007/s10009-021-00634-yopenalex-snapshot
Compositional learning of mutually recursive procedural systems
inferred← citeshttps://doi.org/10.1007/s10270-024-01159-zopenalex-snapshot
Lazy model checking for recursive state machines
inferred← citeshttps://doi.org/10.1007/s10703-007-0040-7openalex-snapshot
The word problem for visibly pushdown languages described by grammars
inferred← citeshttps://doi.org/10.1007/s10990-008-9032-6openalex-snapshot
Types and trace effects for object orientation
inferred← citeshttps://doi.org/10.1007/s11761-013-0146-2openalex-snapshot
On expanding protocol conformance checking to exception handling
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/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.027openalex-snapshot
A Type and Effect System for Flexible Abstract Interpretation of Java
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.05.005openalex-snapshot
Model Checking of Component Protocol Conformance – Optimizations by Reducing False Negatives
inferred← citeshttps://doi.org/10.1016/j.scico.2015.08.010openalex-snapshot
Algorithmic verification of procedural programs in the presence of code variability
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.034openalex-snapshot
Operator precedence temporal logic and model checking
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00034-1openalex-snapshot
Model checking the full modal mu-calculus for infinite sequential processes
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00035-8openalex-snapshot
Syntax-directed model checking of sequential programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00259-2openalex-snapshot
Model Checking Erlang Programs – Abstracting the Context-Free Structure
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80351-7openalex-snapshot
Model Checking Erlang Programs – Abstracting Recursive Function Calls
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80256-7openalex-snapshot
Strict Lower Bounds for Model Checking BPA
inferred← citeshttps://doi.org/10.1017/s0956796807006466openalex-snapshot
Types and trace effects of higher order programs
inferred← citeshttps://doi.org/10.1109/csfw.2002.1021812openalex-snapshot
Analysis of SPKI/SDSI certificates using model checking
inferred← citeshttps://doi.org/10.1109/ecows.2008.11openalex-snapshot
Automatic Protocol Conformance Checking of Recursive and Parallel BPEL Systems
inferred← citeshttps://doi.org/10.1109/lics.1995.523250openalex-snapshot
On the verification problem of nonregular properties for nonregular processes
inferred← citeshttps://doi.org/10.1109/lics.1997.614939openalex-snapshot
How much memory is needed to win infinite games?
inferred← citeshttps://doi.org/10.1137/140978818openalex-snapshot
Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
inferred← citeshttps://doi.org/10.1142/s0129054110007179openalex-snapshot
COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
inferred← citeshttps://doi.org/10.1145/1007512.1007537openalex-snapshot
An optimizing compiler for batches of temporal logic formulas
inferred← citeshttps://doi.org/10.1145/1069774.1069787openalex-snapshot
Trace effects and object orientation
inferred← citeshttps://doi.org/10.1145/1075382.1075387openalex-snapshot
Analysis of recursive state machines
inferred← citeshttps://doi.org/10.1145/1176887.1176925openalex-snapshot
Software partitioning for effective automated unit testing
inferred← citeshttps://doi.org/10.1145/1516512.1516518openalex-snapshot
Adding nesting structure to words
inferred← citeshttps://doi.org/10.1145/1989284.1989286openalex-snapshot
A quest for beauty and wealth (or, business processes for database researchers)
inferred← citeshttps://doi.org/10.1145/199448.199470openalex-snapshot
Verifying infinite state processes with sequential and parallel composition
inferred← citeshttps://doi.org/10.1145/288195.288305openalex-snapshot
Model checking of hierarchical state machines
inferred← citeshttps://doi.org/10.1145/317636.317908openalex-snapshot
Verification of Erlang programs using abstract interpretation and model checking
inferred← citeshttps://doi.org/10.1145/3368089.3409718openalex-snapshot
Domain-independent interprocedural program analysis using block-abstraction memoization
inferred← citeshttps://doi.org/10.1145/503502.503503openalex-snapshot
Model checking of hierarchical state machines
inferred← citeshttps://doi.org/10.14288/1.0051407openalex-snapshot
Compositional model checking of partially ordered state spaces
inferred← citeshttps://doi.org/10.21236/ada417480openalex-snapshot
Dependence Graphs for Information Assurance of Systems
inferred← citeshttps://doi.org/10.2200/s00260ed1v01y201003spt002openalex-snapshot
Analysis Techniques for Information Security
inferred← citeshttps://doi.org/10.2200/s00430ed1v01y201206dtm027openalex-snapshot
Business Processes: A Database Perspective
inferred← citeshttps://doi.org/10.4204/eptcs.277.12openalex-snapshot
Temporal Logic and Model Checking for Operator Precedence Languages
inferred← citeshttps://doi.org/10.7146/brics.v3i54.20057openalex-snapshot
Pushdown Processes: Games and 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.