scientific article; zbMATH DE number 1903348
From MaRDI portal
Publication:4804890
zbMath1010.68095MaRDI QIDQ4804890
Amir Pnueli, Jessie Xu, Lenore D. Zuck
Publication date: 1 May 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2404/24040107.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (20)
Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Model checking and abstraction to the aid of parameterized systems (a survey) ⋮ What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Context-aware counter abstraction ⋮ Unnamed Item ⋮ Modeling and efficient verification of wireless ad hoc networks ⋮ Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ Model checking parameterized asynchronous shared-memory systems ⋮ Finding cut-offs in leaderless rendez-vous protocols is easy ⋮ An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Compositional CSP Traces Refinement Checking ⋮ Smaller Abstractions for ∀CTL* without Next ⋮ View abstraction for systems with component identities ⋮ Chosen-Ciphertext Security from Subset Sum ⋮ Liveness by Invisible Invariants ⋮ On Hierarchical Communication Topologies in the $$\pi $$ -calculus ⋮ Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems ⋮ Counter Abstraction in the CSP/FDR setting
This page was built for publication:
