FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

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

Disclaimer | Powered by EasyChair Smart Program