Cover Image

Safe Composition of Systems of Communicating Finite State Machines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Barbanera, Franco, Hennicker, Rolf
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science F.3.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The General and Finite Satisfiability Problems for PCTL are Undecidable
by: Chodil, Miroslav, et al.
Published: (2024)

Chronology as a Consistency Invariant in Composable Information Systems
by: Calvo, Anherutowa, et al.
Published: (2026)

Centralized vs Decentralized Monitors for Hyperproperties
by: Aceto, Luca, et al.
Published: (2024)

Embedding Differential Dynamic Logic in PVS
by: Slagel, J. Tanner, et al.
Published: (2024)

Just Verification of Mutual Exclusion Algorithms with (Non-)Blocking and (Non-)Atomic Registers
by: van Glabbeek, Rob, et al.
Published: (2026)

Gradual C0: Symbolic Execution for Gradual Verification
by: DiVincenzo, Jenna, et al.
Published: (2022)

A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
by: van Glabbeek, Rob, et al.
Published: (2025)

Sufficient Incorrectness Logic: SIL and Separation SIL
by: Ascari, Flavio, et al.
Published: (2023)

U-Turn: Enhancing Incorrectness Analysis by Reversing Direction
by: Ascari, Flavio, et al.
Published: (2025)

Loop Termination and Generalized Collatz Sequences
by: Carelli, Mishel
Published: (2026)

How to Verify a Turing Machine with Dafny
by: Lederer, Edgar F. A.
Published: (2026)

Calculational Design of Hyperlogics by Abstract Interpretation
by: Cousot, Patrick, et al.
Published: (2024)

Safety, Relative Tightness and the Probabilistic Frame Rule
by: Jereb, Janez Ignacij, et al.
Published: (2025)

Relation-Algebraic Verification of Disjoint-Set Forests
by: Guttmann, Walter
Published: (2023)

A Type Theory for Probabilistic and Bayesian Reasoning
by: Adams, Robin, et al.
Published: (2015)

The Thins Ordering on Relations
by: Voermans, Ed, et al.
Published: (2024)

Diagonals and Block-Ordered Relations
by: Backhouse, Roland, et al.
Published: (2024)

A Real-Analytic Approach to Differential-Algebraic Dynamic Logic
by: Hellwig, Jonathan, et al.
Published: (2025)

The Index and Core of a Relation. With Applications to the Axiomatics of Relation Algebra
by: Backhouse, Roland, et al.
Published: (2023)

Probabilistic Epistemic Dynamic Agentive Logic
by: Logan, Shay Allen
Published: (2026)

Symmetries in Sorting
by: Choudhury, Vikraman, et al.
Published: (2025)

Unified Fairness for Weak Memory Verification
by: Abdulla, Parosh Aziz, et al.
Published: (2023)

Generically Automating Separation Logic by Functors, Homomorphisms and Modules
by: Xu, Qiyuan, et al.
Published: (2024)

Separation Logic of Generic Resources via Sheafeology
by: van Starkenburg, Berend, et al.
Published: (2025)

Reasoning about distributive laws in a concurrent refinement algebra
by: Meinicke, Larissa A., et al.
Published: (2024)

Restructuring a concurrent refinement algebra
by: Hayes, Ian J., et al.
Published: (2024)

An example of goal-directed, calculational proof
by: Backhouse, Roland, et al.
Published: (2023)

Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration (Extended Version)
by: Sextl, Florian, et al.
Published: (2023)

Infinitary Refinement Types for Temporal Properties in Scott Domains
by: Riba, Colin, et al.
Published: (2025)

Bounded Modal Logic
by: Murase, Yuito, et al.
Published: (2026)

A Quadratic Lower Bound for Simulation
by: Groote, Jan Friso, et al.
Published: (2024)

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
by: Borzechowski, Manfred, et al.
Published: (2025)

Simple Types for Polymorphic Functions
by: Jay, Barry, et al.
Published: (2026)

Non-Numerical Weakly Relational Domains
by: Seidl, Helmut, et al.
Published: (2024)

Refinement orders for quantum programs
by: Feng, Yuan, et al.
Published: (2025)

Non-Ground Congruence Closure
by: Leidinger, Hendrik, et al.
Published: (2024)

Well-Scoped Locally Nameless Representation of Syntax
by: Pitts, Andrew M.
Published: (2026)

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
by: Prebet, Enguerrand, et al.
Published: (2026)

A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report
by: Klaus, Natalia, et al.
Published: (2026)

Modelling Recursion and Probabilistic Choice in Guarded Type Theory
by: Stassen, Philipp Jan Andries, et al.
Published: (2024)