Efficient Verification of Lingua Franca Programs
No abstract available.
Related papers
- Package Managers à la Carte: A Formal Model of Dependency Resolution ICFP 2026
- Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization POPL 2019
- Connecting Higher-Order Separation Logic to a First-Order Outside World ESOP 2020
- Thinking Inside the Box: Compartmentalized Garbage Collection TOPLAS 2016
- Efficient Scenario Verification for Hybrid Automata CAV 2011
- Efficient Verification of Timed Automata with BDD-Like Data-Structures VMCAI 2003
- Efficient Algorithms for Verification of Equivalences for Probabilistic Processes CAV 1991
- Efficient Verification with BDDs using Implicitly Conjoined Invariants CAV 1993