CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68653OpenAlexW2499482941MaRDI QIDQ5311479

Tayssir Touili, Muralidhar Talupur, Helmut Veith, Edmund M. Clarke

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100113

Mathematics Subject Classification ID

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 (16)

A case study on parametric verification of failure detectors ⋮ A counter abstraction technique for verifying properties of probabilistic swarm systems ⋮ Parameterized model checking of rendezvous systems ⋮ An invariant-based approach to the verification of asynchronous parameterized networks ⋮ Parameterized verification of time-sensitive models of ad hoc network protocols ⋮ \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms ⋮ A model checking-based approach for security policy verification of mobile systems ⋮ Learning Meets Verification ⋮ Multi-parameterised compositional verification of safety properties ⋮ Verification of Boolean programs with unbounded thread creation ⋮ Parameterized model checking of networks of timed automata with Boolean guards ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Unnamed Item ⋮ Model Checking Parameterised Multi-token Systems via the Composition Method ⋮ Automated formal analysis and verification: an overview ⋮ Parameterised verification for multi-agent systems

This page was built for publication: CONCUR 2004 - Concurrency Theory