The following pages link to Framed temporal logic programming (Q2469157):
Displayed 22 items.
- A mechanism of function calls in MSVL (Q344760) (← links)
- A cylinder computation model for many-core parallel computing (Q391222) (← links)
- A complete proof system for propositional projection temporal logic (Q391223) (← links)
- A formal proof of the deadline driven scheduler in PPTL axiomatic system (Q744103) (← links)
- Unconditional secure communication: a Russian cards protocol (Q987501) (← links)
- Verify heaps via unified model checking (Q1986561) (← links)
- A decision procedure and complete axiomatization for projection temporal logic (Q1986563) (← links)
- Linear time-dependent constraints programming with MSVL (Q2015809) (← links)
- Efficient decision procedure for propositional projection temporal logic (Q2197530) (← links)
- A sound and complete proof system for a unified temporal logic (Q2197533) (← links)
- Compositional reasoning using intervals and time reversal (Q2251129) (← links)
- Translating Xd-C programs to MSVL programs (Q2290648) (← links)
- Index set expressions can represent temporal logic formulas (Q2317353) (← links)
- A structural transformation from p-\(\pi\) to MSVL (Q2354315) (← links)
- Operational semantics of Framed Tempura (Q2378283) (← links)
- An application of temporal projection to interleaving concurrency (Q2403529) (← links)
- Verifying a scheduling protocol of safety-critical systems (Q2424721) (← links)
- Expressiveness of propositional projection temporal logic with star (Q2430015) (← links)
- Extending MSVL with Semaphore (Q2817902) (← links)
- Using Unified Model Checking to Verify Heaps (Q2958361) (← links)
- Axiomatic semantics of projection temporal logic programs (Q3060195) (← links)
- Complexity of propositional projection temporal logic with star (Q3616217) (← links)