On the public citation graph
Recognizing safety and liveness
0 signed · 502 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.1016/0020-0190(86)90132-8openalex-snapshot
Safety without stuttering
inferredcites →https://doi.org/10.1016/0168-0072(91)90066-uopenalex-snapshot
Verification of concurrent programs: the automata-theoretic framework*
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1109/tse.1977.229904openalex-snapshot
Proving the Correctness of Multiprocess Programs
inferredcites →https://doi.org/10.1145/323596.323600openalex-snapshot
On characterization of safety and liveness properties in temporal logic
inferredcites →https://doi.org/10.1145/41625.41626openalex-snapshot
Specification and verification of concurrent programs by A ∀ automata
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.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4752483openalex-extracted
Beyond Monotonicity: Specification and Design of Concurrent Distributed Systems
inferred← citeshttps://doi.org/10.1002/9781119825968.ch6openalex-snapshot
Global States and Termination Detection
inferred← citeshttps://doi.org/10.1002/bltj.2103openalex-snapshot
Systematic software testing using VeriSoft-An analysis of the 4ESS™ heart-beat monitor
inferred← citeshttps://doi.org/10.1007/11555827_21openalex-snapshot
Enforcing Non-safety Security Policies with Program Monitors
inferred← citeshttps://doi.org/10.1007/11689522_22openalex-snapshot
Design and Implementation of an Extended Reference Monitor for Trusted Operating Systems
inferred← citeshttps://doi.org/10.1007/11955757_11openalex-snapshot
Verification of LTL on B Event Systems
inferred← citeshttps://doi.org/10.1007/3-540-36137-5_22openalex-snapshot
Do We Need Liveness? – Approximation of Liveness Properties by Safety Properties
inferred← citeshttps://doi.org/10.1007/3-540-36532-x_10openalex-snapshot
Types and Effects for Non-interfering Program Monitors
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_9openalex-snapshot
Proving Hybrid Protocols Correct
inferred← citeshttps://doi.org/10.1007/3-540-45032-7_10openalex-snapshot
A Framework of Safe Stabilization
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_2openalex-snapshot
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids
inferred← citeshttps://doi.org/10.1007/3-540-48683-6_17openalex-snapshot
Model Checking of Safety Properties
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_87openalex-snapshot
Foundations of compositional program refinement
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_126openalex-snapshot
Safety for branching time semantics
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_32openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_97openalex-snapshot
Characterization of temporal property classes
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_17openalex-snapshot
Partial-order methods for temporal verification
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_202openalex-snapshot
Deterministic Ω automata vis-a-vis deterministic Buchi automata
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_5openalex-snapshot
Efficiently executable temporal logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60385-9_17openalex-snapshot
A partial-order approach to the verification of concurrent systems: Checking liveness properties
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_79openalex-snapshot
Atomicity refinement and trace reduction theorems
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_28openalex-snapshot
Four Issues Concerning the Semantics of Message Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_2openalex-snapshot
Specifying Real-Time Requirements for SDL Specifications — A Temporal Logic-Based Approach
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot
Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-3-030-00350-0_33openalex-snapshot
Linear Temporal Logic Applied to Component-Based Software Architectural Models Specified Through $$\rho _{\mathrm {arq}}$$ρarq Calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-02807-7_4openalex-snapshot
An Adaptable System-on-Chip Security Architecture for Internet of Things Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-03421-4_18openalex-snapshot
Chasing Errors Using Biasing Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-03769-7_7openalex-snapshot
Runtime Verification: From Propositional to First-Order Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-17601-3_2openalex-snapshot
Learning Büchi Automata and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-22348-9_14openalex-snapshot
Refining the Safety–Liveness Classification of Temporal Properties According to Monitorability
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_4openalex-snapshot
Safety and Co-safety Comparator Automata for Discounted-Sum Inclusion
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_5openalex-snapshot
Clock Bound Repair for Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-32079-9_14openalex-snapshot
An Extension of LTL with Rules and Its Application to Runtime Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-32304-2_19openalex-snapshot
Abstract Semantic Dependency
inferred← citeshttps://doi.org/10.1007/978-3-030-54549-9_8openalex-snapshot
Efficient Translation of Safety LTL to DFA Using Symbolic Automata Learning and Inductive Inference
inferred← citeshttps://doi.org/10.1007/978-3-030-58951-6_31openalex-snapshot
Encrypt-to-Self: Securely Outsourcing Storage
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_1openalex-snapshot
First-Order Timed Runtime Verification Using BDDs
inferred← citeshttps://doi.org/10.1007/978-3-030-60508-7_1openalex-snapshot
Monitorability Under Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-60508-7_6openalex-snapshot
BDDs for Representing Data in Runtime Verification
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_1659openalex-snapshot
Oracle (Blockchain Concept)
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_20openalex-snapshot
Certifying Inexpressibility
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_2openalex-snapshot
On Satisficing in Quantitative Games
inferred← citeshttps://doi.org/10.1007/978-3-030-77592-6_7openalex-snapshot
Coalgebraic Approach to Studying Discrete Systems with Output
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-87348-6_2openalex-snapshot
Refining the Safety-Liveness Classification of Temporal Properties According to Realizability
inferred← citeshttps://doi.org/10.1007/978-3-030-88885-5_4openalex-snapshot
Certifying DFA Bounds for Recognition and Separation
inferred← citeshttps://doi.org/10.1007/978-3-030-91077-8_3openalex-snapshot
MDRE System Supportability Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_14openalex-snapshot
On the Complexity of Verification of Time-Sensitive Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_4openalex-snapshot
Monitoring First-Order Interval Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-08143-9_11openalex-snapshot
A Synthesis Tool for Optimal Monitors in a Branching-Time Setting
inferred← citeshttps://doi.org/10.1007/978-3-031-08679-3_1openalex-snapshot
Monitoring Hyperproperties with Circuits
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_9openalex-snapshot
From Spot 2.0 to Spot 2.10: What’s New?
inferred← citeshttps://doi.org/10.1007/978-3-031-21222-2_8openalex-snapshot
Formal Specification for Learning-Enabled Autonomous Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_27openalex-snapshot
Retracing Some Paths in Categorical Semantics: From Process-Propositions-as-Types to Categorified Reals and Computers
inferred← citeshttps://doi.org/10.1007/978-3-031-29857-8_21openalex-snapshot
A Survey and a State-of-the-Art Related to Consensus Mechanisms in Blockchain Technology
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_17openalex-snapshot
Quantitative Safety and Liveness
inferred← citeshttps://doi.org/10.1007/978-3-031-32157-3_6openalex-snapshot
Accelerating Black Box Testing with Light-Weight Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-44267-4_25openalex-snapshot
Monitorability for Runtime Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-47705-8_16openalex-snapshot
Symbolic Model Checking of Relative Safety LTL Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-50521-8_12openalex-snapshot
TP-DejaVu: Combining Operational and Declarative Runtime Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-63992-0_8openalex-snapshot
PPS: A Publish-Process-Subscribe Middleware for Predictive Supply Chains
inferred← citeshttps://doi.org/10.1007/978-3-031-72044-4_1openalex-snapshot
Efficient Temporal Logic Runtime Monitoring for Tiny Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-73741-1_23openalex-snapshot
End-to-End AI Generated Runtime Verification from Natural Language Specification
inferred← citeshttps://doi.org/10.1007/978-3-031-75387-9_1openalex-snapshot
QuAK: Quantitative Automata Kit
inferred← citeshttps://doi.org/10.1007/978-3-031-75434-0_11openalex-snapshot
LLM-Based Scheme for Synthesis of Formal Verification Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-98679-6_1openalex-snapshot
Quantitative Supermartingale Certificates
inferred← citeshttps://doi.org/10.1007/978-3-032-00492-5_3openalex-snapshot
Price Oracle Accuracy Across Blockchains: A Measurement and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-032-00949-4_4openalex-snapshot
Dynamic Resource Security: Authorization and Availability
inferred← citeshttps://doi.org/10.1007/978-3-032-05435-7_12openalex-snapshot
The Power of Reframing: Using LLMs in Synthesizing RV Monitors
inferred← citeshttps://doi.org/10.1007/978-3-032-32132-9_12openalex-snapshot
Mission Resilience and Cybersecurity
inferred← citeshttps://doi.org/10.1007/978-3-032-32519-8_13openalex-snapshot
Decoupled Planning for Multiple Omega-Regular Objectives
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_16openalex-snapshot
Compositional Verification of Timed Automata via Violation Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-319-06859-6_6openalex-snapshot
Model Checking GSM-Based Multi-Agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_1openalex-snapshot
From Reachability to Temporal Specifications in Cost-Sharing Games
inferred← citeshttps://doi.org/10.1007/978-3-319-09581-3_5openalex-snapshot
Linearizability Is Not Always a Safety Property
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_2openalex-snapshot
Temporal Logic and Fair Discrete Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_24openalex-snapshot
Functional Specification of Hardware via Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_3openalex-snapshot
Modeling for Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-11698-3_28openalex-snapshot
Formal Verification of Finite State Transactional Security Policy
inferred← citeshttps://doi.org/10.1007/978-3-319-17112-8_6openalex-snapshot
Monitoring of Client-Cloud Interaction
inferred← citeshttps://doi.org/10.1007/978-3-319-22398-8_1openalex-snapshot
Introduction: Systems Engineering—Why?
inferred← citeshttps://doi.org/10.1007/978-3-319-24177-7_24openalex-snapshot
A Theory of Gray Security Policies
inferred← citeshttps://doi.org/10.1007/978-3-319-24953-7_13openalex-snapshot
Spanning the Spectrum from Safety to Liveness
inferred← citeshttps://doi.org/10.1007/978-3-319-27051-7_29openalex-snapshot
The Design and Implementation of a Dynamic Verification System of Z
inferred← citeshttps://doi.org/10.1007/978-3-319-30303-1_22openalex-snapshot
Security Enforcement by Rewriting: An Algebraic Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-44878-7_14openalex-snapshot
Timed Multiset Rewriting and the Verification of Time-Sensitive Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-45177-0_9openalex-snapshot
Bifurcation Analysis of Cardiac Alternans Using $$\delta $$ -Decidability
inferred← citeshttps://doi.org/10.1007/978-3-319-46969-0_2openalex-snapshot
Developing and Verifying Response Specifications in Hierarchical Event-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-51966-1_12openalex-snapshot
Three Views of Log Trace Triaging
inferred← citeshttps://doi.org/10.1007/978-3-319-66197-1_16openalex-snapshot
Formalizing Timing Diagram Requirements in Discrete Duration Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_12openalex-snapshot
Reasoning About Periodicity on Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-319-94111-0_16openalex-snapshot
Genetic Synthesis of Concurrent Code Using Model Checking and Statistical Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-94111-0_2openalex-snapshot
Efficient Runtime Verification of First-Order Temporal Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_27openalex-snapshot
Symbolic Liveness Analysis of Real-World Software
inferred← citeshttps://doi.org/10.1007/978-3-540-24622-0_12openalex-snapshot
Checking Interval Based Properties for Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_24openalex-snapshot
Intuitionistic LTL and a New Characterization of Safety and Liveness
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_10openalex-snapshot
On Complementing Nondeterministic Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_37openalex-snapshot
Improving the Consistency Checking Process by Reusing Formal Verification Knowledge
inferred← citeshttps://doi.org/10.1007/978-3-540-45064-1_15openalex-snapshot
Reuse of Formal Verification Efforts of Incomplete Models at the Requirements Specification Stage
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_27openalex-snapshot
The Limit View of Infinite Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_48openalex-snapshot
Discriminative Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_26openalex-snapshot
How to Verify and Exploit a Refinement of Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_25openalex-snapshot
Model Checking Liveness Properties of Genetic Regulatory Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74835-9_25openalex-snapshot
Obligations and Their Interaction with Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-76627-8_15openalex-snapshot
Secure Failure Detection in TrustedPals
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_14openalex-snapshot
Environment Assumptions for Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_31openalex-snapshot
Falsification of LTL Safety Properties in Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-00945-7_2openalex-snapshot
Model Checking Usage Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-01702-5_17openalex-snapshot
Structural Contradictions
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_23openalex-snapshot
Model-Checking In-Lined Reference Monitors
inferred← citeshttps://doi.org/10.1007/978-3-642-14706-7_11openalex-snapshot
Using Equivalence Relations for Corrective Enforcement of Security Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-15497-3_6openalex-snapshot
A Theory of Runtime Enforcement, with Results
inferred← citeshttps://doi.org/10.1007/978-3-642-16576-4_2openalex-snapshot
A Formal Framework for Compositional Verification of Organic Computing Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_26openalex-snapshot
Model Checking Hierarchical Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-20000-7_11openalex-snapshot
A Temporal Logic for Mutual Mobile Membranes with Objects on Surface
inferred← citeshttps://doi.org/10.1007/978-3-642-21652-7_2openalex-snapshot
A Developer-Friendly Approach for the Validation of Dynamic Compositions
inferred← citeshttps://doi.org/10.1007/978-3-642-24541-1_34openalex-snapshot
Beyond Traces and Independence
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_1659-1openalex-snapshot
Oracle (Blockchain Concept)
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_10openalex-snapshot
Aspect-Oriented Runtime Monitor Certification
inferred← citeshttps://doi.org/10.1007/978-3-642-28872-2_5openalex-snapshot
Consistency of Service Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-29615-4_11openalex-snapshot
Optimized Inlining of Runtime Monitors
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_53openalex-snapshot
A Model Checker for Hierarchical Probabilistic Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38004-4_1openalex-snapshot
Cost-Aware Runtime Enforcement of Security Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-38323-6_14openalex-snapshot
Noninterference Analysis of Delegation Subterfuge in Distributed Authorization Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_17openalex-snapshot
A Timed Component Algebra for Services
inferred← citeshttps://doi.org/10.1007/978-3-642-39611-3_22openalex-snapshot
Environment-Friendly Safety
inferred← citeshttps://doi.org/10.1007/978-3-642-39611-3_23openalex-snapshot
Deterministic Compilation of Temporal Safety Properties in Explicit State Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_8openalex-snapshot
Network-Formation Games with Regular Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-55415-5_21openalex-snapshot
Compatibility of Safety Properties and Possibilistic Information Flow Security in MAKS
inferred← citeshttps://doi.org/10.1007/978-3-642-58041-3_5openalex-snapshot
The Safety-Progress Classification
inferred← citeshttps://doi.org/10.1007/978-3-642-60119-4_24openalex-snapshot
Towards Guaranteed Quality and Dependability of Information Services
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_12openalex-snapshot
A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
inferred← citeshttps://doi.org/10.1007/978-981-13-9680-9_4openalex-snapshot
OpenFlow-Based Multi-controller Model for Fault-Tolerant and Reliable Control Plane
inferred← citeshttps://doi.org/10.1007/bf01088621openalex-snapshot
Monitoring distributed real-time systems
inferred← citeshttps://doi.org/10.1007/bf01211865openalex-snapshot
Safety, liveness and fairness in temporal logic
inferred← citeshttps://doi.org/10.1007/bf01383879openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferred← citeshttps://doi.org/10.1007/bf01383986openalex-snapshot
A formal theory of simulations between infinite automata
inferred← citeshttps://doi.org/10.1007/bfb0000462openalex-snapshot
Model checking and fault tolerance
inferred← citeshttps://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferred← citeshttps://doi.org/10.1007/bfb0014322openalex-snapshot
Formal verification of Signal programs: Application to a power transformer station controller
inferred← citeshttps://doi.org/10.1007/bfb0030670openalex-snapshot
Towards fault-tolerant and secure agentry
inferred← citeshttps://doi.org/10.1007/bfb0035748openalex-snapshot
Realizable and unrealizable specifications of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0039067openalex-snapshot
A programming logic for formal concurrent systems
inferred← citeshttps://doi.org/10.1007/s00165-009-0130-yopenalex-snapshot
Proving linearizability with temporal logic
inferred← citeshttps://doi.org/10.1007/s00236-017-0307-4openalex-snapshot
Spanning the spectrum from safety to liveness
inferred← citeshttps://doi.org/10.1007/s00236-018-0317-xopenalex-snapshot
Verification of asynchronous systems with an unspecified component
inferred← citeshttps://doi.org/10.1007/s00607-024-01375-xopenalex-snapshot
Runtime verification of electronic stability control system in automated vehicles with STL3 formalism
inferred← citeshttps://doi.org/10.1007/s00766-002-0159-4openalex-snapshot
Arcade: early dynamic property evaluation of requirements using partitioned software architecture models
inferred← citeshttps://doi.org/10.1007/s10009-003-0134-5openalex-snapshot
Unit verification: the CARA experience
inferred← citeshttps://doi.org/10.1007/s10009-012-0224-3openalex-snapshot
Safety first: a two-stage algorithm for the synthesis of reactive systems
inferred← citeshttps://doi.org/10.1007/s10009-012-0233-2openalex-snapshot
Falsification of LTL safety properties in hybrid systems
inferred← citeshttps://doi.org/10.1007/s10009-021-00626-yopenalex-snapshot
An extension of first-order LTL with rules with application to runtime verification
inferred← citeshttps://doi.org/10.1007/s10207-004-0046-8openalex-snapshot
Edit automata: enforcement mechanisms for run-time security policies
inferred← citeshttps://doi.org/10.1007/s10270-013-0366-0openalex-snapshot
Model checking LTL properties over ANSI-C programs with bounded traces
inferred← citeshttps://doi.org/10.1007/s10270-015-0504-yopenalex-snapshot
Towards an integrated formal method for verification of liveness properties in distributed systems: with application to population protocols
inferred← citeshttps://doi.org/10.1007/s10270-017-0591-zopenalex-snapshot
A feature-based classification of formal verification techniques for software models
inferred← citeshttps://doi.org/10.1007/s10270-021-00950-6openalex-snapshot
Incremental execution of temporal graph queries over runtime models with history and its applications
inferred← citeshttps://doi.org/10.1007/s10270-026-01421-6openalex-snapshot
State space-based methods for validating model transformations in model checkers
inferred← citeshttps://doi.org/10.1007/s10506-025-09456-8openalex-snapshot
Automated consistency analysis for legal contracts
inferred← citeshttps://doi.org/10.1007/s10515-007-0013-5openalex-snapshot
Computer-aided Support for Secure Tropos
inferred← citeshttps://doi.org/10.1007/s10559-017-9969-8openalex-snapshot
Problems of Synthesis of Σ-Automata Specified in Languages LP and LF of First Order Logic
inferred← citeshttps://doi.org/10.1007/s10626-009-0084-5openalex-snapshot
Prognosis of ω-Languages for the Diagnosis of *-Languages: A Topological Perspective
inferred← citeshttps://doi.org/10.1007/s10664-021-09938-8openalex-snapshot
Understanding large-scale software systems – structure and flows
inferred← citeshttps://doi.org/10.1007/s10703-011-0117-1openalex-snapshot
On the refinement of liveness properties of distributed systems
inferred← citeshttps://doi.org/10.1007/s10703-017-0277-8openalex-snapshot
On relative and probabilistic finite counterability
inferred← citeshttps://doi.org/10.1007/s10703-017-0304-9openalex-snapshot
Theory and methodology of assumption/commitment based system interface specification and architectural contracts
inferred← citeshttps://doi.org/10.1007/s10703-018-00327-4openalex-snapshot
First-order temporal logic monitoring with BDDs
inferred← citeshttps://doi.org/10.1007/s10703-022-00397-5openalex-snapshot
Automated repair for timed systems
inferred← citeshttps://doi.org/10.1007/s10703-023-00429-8openalex-snapshot
On monitoring linear temporal properties
inferred← citeshttps://doi.org/10.1007/s11334-022-00446-6openalex-snapshot
Certifying DFA Bounds for Recognition and Separation
inferred← citeshttps://doi.org/10.1007/s11704-016-6041-1openalex-snapshot
An efficient and highly available framework of data recency enhancement for eventually consistent data stores
inferred← citeshttps://doi.org/10.1007/s13347-023-00642-7openalex-snapshot
From Coding To Curing. Functions, Implementations, and Correctness in Deep Learning
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90061-lopenalex-snapshot
Proving correctness with respect to nondeterministic safety specifications
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90244-copenalex-snapshot
Safety and liveness of ω-context-free languages
inferred← citeshttps://doi.org/10.1016/0169-7552(90)90132-copenalex-snapshot
Protocol specification for OSI
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00254-5openalex-snapshot
Interval logics and their decision procedures
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50021-8openalex-snapshot
A Formal Theory of Simulations Between Infinite Automata
inferred← citeshttps://doi.org/10.1016/bs.adcom.2017.11.001openalex-snapshot
Advances in Software Model Checking
inferred← citeshttps://doi.org/10.1016/j.bcra.2025.100339openalex-snapshot
Smart listeners: A hybrid-optimistic inter-blockchain communication protocol
inferred← citeshttps://doi.org/10.1016/j.cose.2009.09.003openalex-snapshot
Runtime verification of cryptographic protocols
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.06.002openalex-snapshot
Linear Temporal Logic Symbolic Model Checking
inferred← citeshttps://doi.org/10.1016/j.cosrev.2012.01.001openalex-snapshot
Which security policies are enforceable by runtime monitors? A survey
inferred← citeshttps://doi.org/10.1016/j.ejcon.2014.11.001openalex-snapshot
Control design for nondeterministic input/output automata
inferred← citeshttps://doi.org/10.1016/j.engappai.2018.01.002openalex-snapshot
Secure information sharing in social agent interactions using information flow analysis
showing the first 199 of 488 · page through all 488
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.