On the public citation graph
Results on the propositional μ-calculus
0 signed · 228 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-10003-2_83openalex-snapshot
A representation theorem for models of *-free PDL
inferredcites →https://doi.org/10.1007/3-540-11160-3_1openalex-snapshot
On the duality of dynamic algebras and kripke models
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1016/0022-0000(79)90046-1openalex-snapshot
Propositional dynamic logic of regular programs
inferredcites →https://doi.org/10.1016/0022-0000(80)90061-6openalex-snapshot
A near-optimal method for reasoning about action
inferredcites →https://doi.org/10.1016/0304-3975(81)90019-0openalex-snapshot
An elementary proof of the completeness of PDL
inferredcites →https://doi.org/10.1109/sfcs.1981.4openalex-snapshot
A decidable mu-calculus: Preliminary report
inferredcites →https://doi.org/10.1109/sfcs.1981.49openalex-snapshot
The prepositional dynamic logic of deterministic, well-structured programs
inferredcites →https://doi.org/10.1145/800076.802492openalex-snapshot
Propositional Dynamic Logic of looping and converse
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/stvr.441openalex-snapshot
A framework for automatic generation of security controller
inferred← citeshttps://doi.org/10.1007/11538363_29openalex-snapshot
PDL with Intersection and Converse Is Decidable
inferred← citeshttps://doi.org/10.1007/11560548_7openalex-snapshot
Verifying Quantitative Properties Using Bound Functions
inferred← citeshttps://doi.org/10.1007/11560586_9openalex-snapshot
Checking Risky Events Is Enough for Local Policies
inferred← citeshttps://doi.org/10.1007/11560647_29openalex-snapshot
Quantitative Temporal Logic Mechanized in HOL
inferred← citeshttps://doi.org/10.1007/11690634_10openalex-snapshot
On the μ-Calculus Augmented with Sabotage
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_117openalex-snapshot
Propositional logics of programs: New directions
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_370openalex-snapshot
A decision procedure for the propositional μ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_20openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_43openalex-snapshot
The propositional mu-calculus is elementary
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_27openalex-snapshot
Fixpoints and program looping: Reductions from the Propositional mu-calculus into Propositional Dynamic Logics of Looping
inferred← citeshttps://doi.org/10.1007/3-540-34874-3_17openalex-snapshot
Social Interaction, Knowledge, and Social Software
inferred← citeshttps://doi.org/10.1007/3-540-36384-x_16openalex-snapshot
Lifting Temporal Proofs through Abstractions
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_5openalex-snapshot
Efficient Model Checking Via Büchi Tableau Automata?
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_7openalex-snapshot
A Practical Approach to Coverage in Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_33openalex-snapshot
From Programs to Games: Invariance and Safety for Bisimulation
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_79openalex-snapshot
Discounting the Future in Systems Theory
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_21openalex-snapshot
An Adequate Logic for Full LOTOS
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-46562-6_22openalex-snapshot
Compositional Verification of CCS Processes
inferred← citeshttps://doi.org/10.1007/3-540-46674-6_9openalex-snapshot
A Framework for Formal Reasoning about Open Distributed Systems
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_19openalex-snapshot
If: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_38openalex-snapshot
Verifying a Distributed Database Lookup Manager Written in Erlang
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_28openalex-snapshot
On the Structure of the Monadic Logic of the Binary Tree
inferred← citeshttps://doi.org/10.1007/3-540-49163-5_3openalex-snapshot
On Hybrid Systems and the Modal µ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_135openalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_4openalex-snapshot
Efficient local correctness checking
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-61440-0_138openalex-snapshot
Fixpoints for rabin tree automata make complementation easy
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_23openalex-snapshot
μ-calculus Pushdown Module Checking with Imperfect State Information
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_1openalex-snapshot
A Refinement Logic for the Fork Calculus
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_20openalex-snapshot
Dynamic priorities for modeling real-time
inferred← citeshttps://doi.org/10.1007/978-0-387-35578-8_14openalex-snapshot
An Optimizing Compiler for Efficient Model Checking
inferred← citeshttps://doi.org/10.1007/978-0-387-72496-6_5openalex-snapshot
Service-oriented Mediation with jABC/jETI
inferred← citeshttps://doi.org/10.1007/978-1-4020-8157-6_23openalex-snapshot
Static Program Transformations for Efficient Software Model Checking
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-30942-8_7openalex-snapshot
GR(1)*: GR(1) Specifications Extended with Existential Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-030-31517-7_11openalex-snapshot
Verifying System-Wide Properties of Industrial Component-Based Software
inferred← citeshttps://doi.org/10.1007/978-3-030-50029-0_23openalex-snapshot
Combining SLiVER with CADP to Analyze Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-78089-0_1openalex-snapshot
On Bidirectional Runtime Enforcement
inferred← citeshttps://doi.org/10.1007/978-3-030-78089-0_14openalex-snapshot
Better Late Than Never or: Verifying Asynchronous Components at Runtime
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_1openalex-snapshot
Non-well-founded Deduction for Induction and Coinduction
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_23openalex-snapshot
Towards a Trustworthy Semantics-Based Language Framework via Proof Generation
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_9openalex-snapshot
Efficient Algorithms for Omega-Regular Energy Games
inferred← citeshttps://doi.org/10.1007/978-3-031-08143-9_12openalex-snapshot
A Monitoring Tool for Linear-Time $$\mu $$HML
inferred← citeshttps://doi.org/10.1007/978-3-031-32157-3_9openalex-snapshot
Elimination of Detached Regions in Dependency Graph Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-35355-0_4openalex-snapshot
Implementing a CTL Model Checker with $$\mu \mathcal {G}$$, a Language for Programming Graph Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_8openalex-snapshot
Branching Bisimulation Learning
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_13openalex-snapshot
Abstraction and Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-319-57861-3_10openalex-snapshot
Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-60134-2_1openalex-snapshot
On the Complexity of Determinizing Monitors
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_10openalex-snapshot
Negative Results on Decidability and Small Model Property of Process Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_4openalex-snapshot
Logical Characterisation of Parameterised Bisimulations
inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_22openalex-snapshot
Symmetry Reduction for the Local Mu-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_5openalex-snapshot
An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-27815-3_32openalex-snapshot
Modal Abstractions in μCRL
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_29openalex-snapshot
Abstraction for Branching Time Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-45091-7_7openalex-snapshot
Description Logics for Ontologies
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_12openalex-snapshot
A Model Checking Language for Concurrent Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_10openalex-snapshot
From Church and Prior to PSL
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_49openalex-snapshot
Correcting a Space-Efficient Simulation Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-73986-9_14openalex-snapshot
Synthesis of Non-interferent Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_20openalex-snapshot
Regular Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_19openalex-snapshot
A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_36openalex-snapshot
From Monadic Logic to PSL
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_13openalex-snapshot
Model Checking for Action Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_17openalex-snapshot
Coalgebraic Logic and Synthesis of Mealy Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_6openalex-snapshot
Computation Tree Regular Logic for Genetic Regulatory Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-92701-3_7openalex-snapshot
From Philosophical to Industrial Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_2openalex-snapshot
Weighted versus Probabilistic Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-05082-4_18openalex-snapshot
A Logic Based Approach to the Static Analysis of Production Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_22openalex-snapshot
Regular Linear Temporal Logic with Past
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_3openalex-snapshot
Compositional and Quantitative Model Checking (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_12openalex-snapshot
An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-24690-6_3openalex-snapshot
Developing Model-Checking Mechanisms for ASSL: An Experience Report
inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_19openalex-snapshot
Specification in PDL with Recursion
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_13openalex-snapshot
SPARQL Query Containment under RDFS Entailment Regime
inferred← citeshttps://doi.org/10.1007/978-3-642-34026-0_11openalex-snapshot
A Formal Approach to Software Product Families
inferred← citeshttps://doi.org/10.1007/978-3-642-34188-5_13openalex-snapshot
Concurrent Small Progress Measures
inferred← citeshttps://doi.org/10.1007/978-3-642-45321-2_5openalex-snapshot
From Löwenheim to PSL and SVA
inferred← citeshttps://doi.org/10.1007/978-3-642-76562-9_13openalex-snapshot
Computer Aided Verification of Parallel Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_13openalex-snapshot
A Logic for the Specification and Proof of Controllable Processes of CCS
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_26openalex-snapshot
Measure Properties of Game Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_18openalex-snapshot
Decidability and Expressiveness of Recursive Weighted Logic
inferred← citeshttps://doi.org/10.1007/978-981-96-0692-4_23openalex-snapshot
An Empirical Evaluation of Algorithms for Simple Stochastic Games
inferred← citeshttps://doi.org/10.1007/bf00288467openalex-snapshot
A logic for the specification and proof of regular controllable processes of CCS
inferred← citeshttps://doi.org/10.1007/bf00370554openalex-snapshot
A finite model theorem for the propositional ?-calculus
inferred← citeshttps://doi.org/10.1007/bf01211296openalex-snapshot
A methodology for designing proof rules for fair parallel programs
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/bf01887208openalex-snapshot
A refinement calculus for specifications in Hennessy-Milner logic with recursion
inferred← citeshttps://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0023896openalex-snapshot
On the expressive power of modal logics on trees
inferred← citeshttps://doi.org/10.1007/bfb0027421openalex-snapshot
A tableau proof system for a mazurkiewicz trace logic with fixpoints
inferred← citeshttps://doi.org/10.1007/bfb0031992openalex-snapshot
Real-time and the Mu-Calculus (preliminary report)
inferred← citeshttps://doi.org/10.1007/bfb0032056openalex-snapshot
Compositionality through an operational semantics of contexts
inferred← citeshttps://doi.org/10.1007/bfb0035394openalex-snapshot
An automata based verification environment for mobile processes
inferred← citeshttps://doi.org/10.1007/bfb0055090openalex-snapshot
Reasoning about the past with two-way automata
inferred← citeshttps://doi.org/10.1007/s00165-021-00535-6openalex-snapshot
GR(1)*: GR(1) specifications extended withexistential guarantees
inferred← citeshttps://doi.org/10.1007/s00446-026-00512-3openalex-snapshot
On the notions of bounded bypass, and how to make any deadlock-free MUTEX protocol satisfy one of them
inferred← citeshttps://doi.org/10.1007/s10009-009-0110-9openalex-snapshot
Solving scheduling problems by untimed model checking
inferred← citeshttps://doi.org/10.1007/s10009-020-00578-9openalex-snapshot
Dependency graphs with applications to verification
inferred← citeshttps://doi.org/10.1007/s10699-019-09611-wopenalex-snapshot
Why There is no General Solution to the Problem of Software Verification
inferred← citeshttps://doi.org/10.1007/s10703-006-0029-7openalex-snapshot
An abstract interpretation toolkit for μCRL
inferred← citeshttps://doi.org/10.1007/s10817-013-9294-5openalex-snapshot
A Goal-Directed Decision Procedure for Hybrid PDL
inferred← citeshttps://doi.org/10.1007/s10958-007-0331-yopenalex-snapshot
Potential theory for mean payoff games
inferred← citeshttps://doi.org/10.1007/s11334-009-0091-6openalex-snapshot
Tool-supported enhancement of diagnosis in model-driven verification
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90027-8openalex-snapshot
Equivalences among logics of programs
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90088-0openalex-snapshot
Concurrent program schemes and their logics
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90038-jopenalex-snapshot
Proof systems for satisfiability in Hennessy-Milner Logic with recursion
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90155-mopenalex-snapshot
The expressive power of implicit specifications
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90031-xopenalex-snapshot
An automata theoretic decision procedure for the propositional mu-calculus
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90058-popenalex-snapshot
A compositional proof system on a category of labelled transition systems
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/j.apal.2009.07.015openalex-snapshot
The variable hierarchy for the games μ -calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.070openalex-snapshot
An Abstract Interpretation Toolkit for μCRL
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.08.016openalex-snapshot
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.04.008openalex-snapshot
A Solver for Modal Fixpoint Logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.018openalex-snapshot
Alternation-Free Weighted Mu-Calculus: Decidability and Completeness
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104804openalex-snapshot
Temporal logic with recursion
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.05.003openalex-snapshot
Comparing disjunctive modal transition systems with an one-selecting variant
inferred← citeshttps://doi.org/10.1016/j.scico.2014.04.004openalex-snapshot
Property-dependent reductions adequate with divergence-sensitive branching bisimilarity
inferred← citeshttps://doi.org/10.1016/j.scico.2015.08.005openalex-snapshot
Formal specification and verification of TCP extended with the Window Scale Option
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.034openalex-snapshot
A linear translation from CTL* to the first-order modal μ -calculus
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/s0019-9958(82)91258-xopenalex-snapshot
Propositional dynamic logic of looping and converse is elementarily decidable
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80049-2openalex-snapshot
Fixed-point characterization of context-free ∞-languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80027-9openalex-snapshot
A zero-one law for logic with a fixed-point operator
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80031-6openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80038-9openalex-snapshot
A logic for the description of non-deterministic programs and their properties
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73078-0openalex-snapshot
The Logic of Games and its Applications
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80023-1openalex-snapshot
20 Modal logic for games and information
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot
Time in Qualitative Simulation
inferred← citeshttps://doi.org/10.1023/a:1020883625495openalex-snapshot
Lightweight Reasoning about Program Correctness
inferred← citeshttps://doi.org/10.1109/acc.2005.1470310openalex-snapshot
You can always compute maximally permissive controllers under partial observation when they exist
inferred← citeshttps://doi.org/10.1109/ccece.2007.356openalex-snapshot
Formal Verification of Mutual Exclusion Between the Guards of Deterministic Choice Structures
inferred← citeshttps://doi.org/10.1109/cdc.2005.1582121openalex-snapshot
A generic approach to the control of discrete event systems
inferred← citeshttps://doi.org/10.1109/icarcv.2012.6485166openalex-snapshot
An integrated state- and event-based framework for verifying liveness in supervised systems
inferred← citeshttps://doi.org/10.1109/icet.2009.5353152openalex-snapshot
Analysis and verification of Two-Phase Commit & Three-Phase Commit Protocols
inferred← citeshttps://doi.org/10.1109/icis.2012.92openalex-snapshot
Research on Formal Modeling and Verification of BPEL-based Web Service Composition
inferred← citeshttps://doi.org/10.1109/icws.2012.64openalex-snapshot
Behavior Classes for Specification and Search of Complex Services and Processes
inferred← citeshttps://doi.org/10.1109/iros.2012.6385935openalex-snapshot
Temporal logic robot mission planning for slow and fast actions
inferred← citeshttps://doi.org/10.1109/lics.1988.5113openalex-snapshot
A category of labelled Petri nets and compositional proof system
inferred← citeshttps://doi.org/10.1109/lics.1990.113764openalex-snapshot
Real-time logics: complexity and expressiveness
inferred← citeshttps://doi.org/10.1109/lics.1994.316085openalex-snapshot
Foundations of timed concurrent constraint programming
inferred← citeshttps://doi.org/10.1109/lics.1997.614945openalex-snapshot
Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices
inferred← citeshttps://doi.org/10.1109/rcis.2010.5507384openalex-snapshot
A formal definition of software architecture behavioral concepts
inferred← citeshttps://doi.org/10.1109/sefm.2005.16openalex-snapshot
Description logics for shape analysis
inferred← citeshttps://doi.org/10.1109/sew.2012.10openalex-snapshot
Analysing Tactics in Architectural Patterns
inferred← citeshttps://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferred← citeshttps://doi.org/10.1109/tase.2012.20openalex-snapshot
Integrating Model-Based Testing and Analysis Tools via Test Case Exchange
inferred← citeshttps://doi.org/10.1109/time.2010.29openalex-snapshot
Regular Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1109/wodes.2002.1167682openalex-snapshot
Model checking embedded system designs
inferred← citeshttps://doi.org/10.1109/zinc50678.2020.9161435openalex-snapshot
SpeCS — SPARQL Query Containment Solver
inferred← citeshttps://doi.org/10.1145/1040305.1040328openalex-snapshot
Context logic and tree update
inferred← citeshttps://doi.org/10.1145/1081180.1081188openalex-snapshot
Solving scheduling problems by untimed model checking
inferred← citeshttps://doi.org/10.1145/1141277.1141694openalex-snapshot
Modeling and analyzing applications with domain-specific languages by reflective rewriting
inferred← citeshttps://doi.org/10.1145/1182613.1182616openalex-snapshot
Results on the quantitative μ-calculus qM μ
inferred← citeshttps://doi.org/10.1145/1244002.1244324openalex-snapshot
Analysis and verification of an automatic document feeder
inferred← citeshttps://doi.org/10.1145/1342991.1342992openalex-snapshot
A comprehensive combination framework
inferred← citeshttps://doi.org/10.1145/1552309.1552313openalex-snapshot
Local policies for resource usage analysis
inferred← citeshttps://doi.org/10.1145/2364412.2364425openalex-snapshot
Towards an incremental automata-based approach for software product-line model checking
inferred← citeshttps://doi.org/10.1145/2427376.2427382openalex-snapshot
Incremental formal verification for model refining
inferred← citeshttps://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferred← citeshttps://doi.org/10.1145/3428229openalex-snapshot
Towards a unified proof framework for automated fixpoint reasoning using matching logic
inferred← citeshttps://doi.org/10.1145/3471871.3472963openalex-snapshot
Graft: general purpose raft consensus in Elixir
inferred← citeshttps://doi.org/10.1145/3832783.3837439openalex-snapshot
Best-Effort GR(1) Synthesis: Exploiting Environmental Cooperation under Unrealizability
inferred← citeshttps://doi.org/10.1145/963927.963929openalex-snapshot
Precongruence formats for decorated trace semantics
inferred← citeshttps://doi.org/10.15388/informatica.2017.143openalex-snapshot
From Process Models to Concurrent Systems in Alvis Language
inferred← citeshttps://doi.org/10.18154/rwth-conv-121030openalex-snapshot
Pure and applied fixed point logics
inferred← citeshttps://doi.org/10.21236/ada417480openalex-snapshot
Dependence Graphs for Information Assurance of Systems
inferred← citeshttps://doi.org/10.2178/jsl/1231082313openalex-snapshot
PDL with intersection and converse: satisfiability and infinite-state model checking
inferred← citeshttps://doi.org/10.22028/d291-26295openalex-snapshot
Incremental decision procedures for modal logics with nominals and eventualities
inferred← citeshttps://doi.org/10.2514/1.32013openalex-snapshot
Game-Based Model Checking for Reliable Autonomy in Space
inferred← citeshttps://doi.org/10.25368/2022.120openalex-snapshot
Terminological cycles in a description logic with existential restrictions
inferred← citeshttps://doi.org/10.25560/12175openalex-snapshot
Parity games : descriptive complexity and algorithms for new solvers
inferred← citeshttps://doi.org/10.25560/6348openalex-snapshot
Finite-State Abstractions for Probabilistic Computation Tree Logic
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25ce9openalex-snapshot
Quasipolynomial Computation of Nested Fixpoints
inferred← citeshttps://doi.org/10.3166/jancl.17.317-346openalex-snapshot
Definable fixed points in modal and temporal logics : A survey
inferred← citeshttps://doi.org/10.3233/fi-1998-33401openalex-snapshot
Coinductive Axiomatization of Recursive Type Equality and Subtyping
inferred← citeshttps://doi.org/10.3390/axioms5020016openalex-snapshot
Contribution of Warsaw Logicians to Computational Logic
inferred← citeshttps://doi.org/10.3929/ethz-a-006183969openalex-snapshot
From temporal logics to automata via alternation elimination
inferred← citeshttps://doi.org/10.4204/eptcs.191.10openalex-snapshot
The Arity Hierarchy in the Polyadic μ-Calculus
inferred← citeshttps://doi.org/10.4204/eptcs.77.6openalex-snapshot
Model-Checking the Higher-Dimensional Modal mu-Calculus
inferred← citeshttps://doi.org/10.4230/dagsemproc.09201.9openalex-snapshot
Component-Oriented Behavior Extraction for Autonomic System Design
showing the first 200 of 217 · page through all 217
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.