No article text was recorded for this version.
liveness property verification
Version 1 of 1196 papers224 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Resource Usage Analysis for the Pi-Calculus
- Blog: SysMoBench: Evaluating AI on Formally Specifying Complex Real-World Systems
- Blog: Towards Scalable Verification of RL-Driven Systems
- Blog: Model checking parameterized asynchronous shared-memory systems
- Blog: From Timed Automata to Logic - and Back
- Blog: General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- Blog: MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
- Blog: Co-Buchi Barrier Certificates for Discrete-time Dynamical Systems
- Blog: Event-based Formalization of Safety-critical Operating System Standards: An Experience Report on ARINC 653 using Event-B
- Blog: Task and Motion Policy Synthesis as Liveness Games
- Blog: Proving non-termination
- Blog: Context-bounded verification of liveness properties for multithreaded shared-memory programs
- Blog: Let a Neural Network be Your Invariant
- Blog: The Power of Reachability Testing for Timed Automata
- Blog: Start Pruning When Time Gets Urgent: Partial Order Reduction for Timed Systems
- Blog: Synthesizing Dominant Strategies for Liveness
- Blog: Certifying Safety when Implementing Consensus
- Blog: Angelic Semantics of Fine-Grained Concurrency
- Blog: Parameterized Synthesis with Safety Properties
- Blog: AutoSVA: Democratizing Formal Verification of RTL Module Interactions
- Blog: Liveness with Invisible Ranking
- Blog: On Relative and Probabilistic Finite Counterability
- Blog: Approximate Automata for Omega-Regular Languages
- Blog: Proving Non-termination by Program Reversal
- Blog: Hypernode automata
- Blog: Parameterized Verification of Asynchronous Shared-Memory Systems
- Blog: Computer-assisted simulation proofs
- Blog: Compositional Reasoning for Shared-variable Concurrent Programs
- Blog: Liveness by Invisible Invariants
- Blog: Session Communication and Integration
- Blog: Verifying Liveness Properties of ML Programs
- Blog: Exemplifying parametric timed specifications over signals with bounded behavior
- Blog: Algorithmic verification of asynchronous programs
- Blog: Synthesis of Admissible Shields
- Blog: A Theoretical Framework for Symbolic Quick Error Detection
- Blog: Formal Verification of Flow Equivalence in Desynchronized Designs
- Blog: Super-Dense Computation in Verification of Hybrid CSP Processes
- Blog: Don't sit on the fence: A static analysis approach to automatic fence insertion
- Blog: Proving Simpson's Four-Slot Algorithm Using Ownership Transfer
- Blog: Verifying an HTTP Key-Value Server with Interaction Trees and VST
- Blog: Quantifying Software Correctness by Combining Architecture Modeling and Formal Program Analysis
- Blog: Experimental Analysis of Different Techniques for Bounded Model Checking
- Blog: Symbolic Controller Synthesis for Büchi Specifications on Stochastic Systems
- Blog: Software Verification of Hyperproperties Beyond k-Safety
- Blog: Probabilistic Black-Box Checking via Active MDP Learning
- Blog: Verifying Complex Systems Probabilistically through Learning, Abstraction and Refinement
- Blog: VCEGAR: Verilog CounterExample Guided Abstraction Refinement
- Blog: Temporal Logic Verification of Stochastic Systems Using Barrier Certificates
- Blog: D3S: Debugging Deployed Distributed Systems
- Blog: General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond
- Blog: Lost in Abstraction: Monotonicity in Multi-threaded Programs
- Blog: Learning Approximate Forward Reachable Sets Using Separating Kernels
- Blog: Compositional Stochastic Model Checking Probabilistic Automata via Assume-guarantee Reasoning
- Blog: A Compositional Specification Theory for Component Behaviours
- Blog: BBReach: Tight and Scalable Black-Box Reachability Analysis of Deep Reinforcement Learning Systems
- Blog: Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory
- Blog: AISE v2.0: Combining Loop Transformations
- Blog: sfHornStr: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses
- Blog: Reactive Safety
- Blog: Regular Abstractions for Array Systems
Showing 60 of 196 papers.
History & citation
Current · Permanent link
- Formal Verification of Safety and Liveness Properties merged into this direction (84% overlap)
- Automated Verification of Liveness Properties merged into this direction (82% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_liveness_property_verification_4739e948,
title = {liveness property verification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/liveness-property-verification/rdr_4739e94822c642d797e5894de6f057fc},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_liveness_property_verification_4739e948_v1,
title = {liveness property verification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/liveness-property-verification/rdr_4739e94822c642d797e5894de6f057fc/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}