FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

A
Absolute Correctness	Programming Without Refinement (PDF, talk)
Agda	Ordering strict partial orders to model behavioural refinement (PDF, talk)
C
CCSL	Ordering strict partial orders to model behavioural refinement (PDF, talk)
concurrency	Challenges of specifying concurrent program components (PDF, talk)
Concurrent objects	Correctness of Concurrent Objects under Weak Memory Models (PDF, talk) Refining Santa: An Excercise in Efficient Synchronization (PDF, talk)
Concurrent operation specification	Challenges of specifying concurrent program components (PDF, talk)
correctness	Correctness of Concurrent Objects under Weak Memory Models (PDF, talk)
Correctness Enhancement	Programming Without Refinement (PDF, talk)
D
Deriving Reliable Programs	Programming Without Refinement (PDF, talk)
I
imperative	A Theory of Lazy Imperative Timing (PDF, talk)
L
lazy	A Theory of Lazy Imperative Timing (PDF, talk)
P
Program Derivation	Programming Without Refinement (PDF, talk)
Program Projection	Programming Without Refinement (PDF, talk)
R
refinement	Correctness of Concurrent Objects under Weak Memory Models (PDF, talk) Refining Santa: An Excercise in Efficient Synchronization (PDF, talk)
Relative Correctness	Programming Without Refinement (PDF, talk)
rely/guarantee concurrency	Challenges of specifying concurrent program components (PDF, talk)
S
Strict partial orders	Ordering strict partial orders to model behavioural refinement (PDF, talk)
Synchronization	Refining Santa: An Excercise in Efficient Synchronization (PDF, talk)
T
The Santa Claus Problem	Refining Santa: An Excercise in Efficient Synchronization (PDF, talk)
Time Models	Ordering strict partial orders to model behavioural refinement (PDF, talk)
Time Refinement	Ordering strict partial orders to model behavioural refinement (PDF, talk)
timing	A Theory of Lazy Imperative Timing (PDF, talk)
W
weak memory models	Correctness of Concurrent Objects under Weak Memory Models (PDF, talk)

Disclaimer | Powered by EasyChair Smart Program