Proving Correctness of Constraint Logic Programs with Dynamic Scheduling
No abstract available.
Related papers
- Proving Concurrent Constraint Programs Correct TOPLAS 1997
- Independence in CLP languages TOPLAS 2000
- Proving Concurrent Constraint Programs Correct POPL 1994
- HaliVer: Deductive Verification and Scheduling Languages Join Forces TACAS 2024
- Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling ESOP 2003
- Analyzing Logic Programs with Dynamic Scheduling POPL 1994
- A termination analyzer for Java bytecode based on path-length TOPLAS 2010
- Automated Verification for Real-Time Systems - via Implicit Clocks and an Extended Antimirov Algorithm TACAS 2023