TLA

swMATH4442MaRDI QIDQ16618FDOQ16618

Author name not available (Why is that?)

Cited In (28)

• Specifying reversibility with \(\mathrm{TLA}^+\)
• Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms
• Predicate transformers for reasoning about concurrent computation
• The Temporal Logic of Rewriting: A Gentle Introduction
• CPO semantics of timed interactive actor networks
• What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
• How to write a 21\(^{\text{st}}\) century proof
• ASM refinement and generalizations of forward simulation in data refinement: a comparison
• Computer Aided Verification
• Rule-Based Refinement of Petri Nets: A Survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API
• A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms
• Variability encoding: from compile-time to load-time variability
• Title not available (Why is that?)
• XL: An XML programming language for web service specification and composition.
• Title not available (Why is that?)
• Minha: Large-scale distributed systems testing made practical
• SCTL-MUS: A formal methodology for software development of distributed systems. A case study
• csp2B: A practical approach to combining CSP and B
• Designing a semantic model for a wide-spectrum language with concurrency
• Title not available (Why is that?)
• Computer Aided Verification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Engineering and theoretical underpinnings of retrenchment
• Real-time system = discrete system + clock variables

This page was built for software: TLA