Boolean and 2-adic Numbers Based Techniques for Verifying Synchronous Design
No abstract available.
DOI 10.1007/3-540-63166-6_30
Related papers
- A formal proof of hensel's lemma over the p-adic integers CPP 2019
- Formalizing the ring of Witt vectors CPP 2021
- A Formalization of Complete Discrete Valuation Rings and Local Fields CPP 2024
- Implementation of the Data-Flow Synchronous Language SIGNAL PLDI 1995
- The Design and Implementation of a Verification Technique for GPU Kernels TOPLAS 2015
- Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking TACAS 2019
- HybridSynchAADL: Modeling and Formal Analysis of Virtually Synchronous CPSs in AADL CAV 2021
- NDetermin: inferring nondeterministic sequential specifications for parallelism correctness PPoPP 2012