Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract)
No abstract available.
DOI 10.1007/3-540-63166-6_31
Related papers
- Active Learning of Deterministic Timed Automata with Myhill-Nerode Style Characterization CAV 2023
- Quasi-static scheduling for safe futures PPoPP 2008
- Secure implementations of typed channel abstractions POPL 2007
- Model Checking Linear Properties of Prefix-Recognizable Systems CAV 2002
- Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi SAS 2002
- Abstraction Modulo Stability for Reverse Engineering CAV 2022
- Static Analysis by Abstract Interpretation of the Quasi-synchronous Composition of Synchronous Programs VMCAI 2005
- Quasi-Linear Types POPL 1999