Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
Abstract elided by the publisher.
Related papers
- 42: programmable models of computation for a component-based approach to heterogeneous embedded systems GPCE 2007
- Model Checking for Programming Languages using Verisoft POPL 1997
- Ptolemy: A Language with Quantified, Typed Events ECOOP 2008
- Fair Termination for Parameterized Probabilistic Concurrent Systems TACAS 2017
- Access-Right Expressions TOPLAS 1983
- Proving thread termination PLDI 2007
- Bounded Model Checking for Asynchronous Hyperproperties TACAS 2023
- Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs CAV 2011