VSL 2014: VIENNA SUMMER OF LOGIC 2014

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

A
algebraic program structures	Algebraic description of restricted programming and elements of its logics
Applications of logic to combinatorics	Explaining the decompositionality of MSO using applications to combinatorics
axiomatic semantics	Using Esoteric Language for Teaching Formal Semantics
C
Computer Science Education	Fun With Formal Methods 2014: Opening Remarks
concurrency and synchronization	An Example Demonstrating the Requirement of Fully Formal Verification Method
Courcelle's theorem	Explaining the decompositionality of MSO using applications to combinatorics
crowd sourcing	Chekofv: Crowd-sourced Formal Verification
D
denotational semantics	Using Esoteric Language for Teaching Formal Semantics
domain specific modeling	Introducing Formal Verification with Lego
E
education	Introducing Formal Verification with Lego
esoteric language	Using Esoteric Language for Teaching Formal Semantics
F
formal methods	Towards the Application of Formal Methods in Process Engineering Fun With Formal Methods 2014: Opening Remarks Introducing Formal Verification with Lego An Example Demonstrating the Requirement of Fully Formal Verification Method
Formal semantics	Using Esoteric Language for Teaching Formal Semantics
fully invertible and injective programs	Algebraic description of restricted programming and elements of its logics
fun	Introducing Formal Verification with Lego
G
gamification	Chekofv: Crowd-sourced Formal Verification
I
invariant computation	Chekofv: Crowd-sourced Formal Verification
M
make-easy" teaching approach	Using Esoteric Language for Teaching Formal Semantics
model checking	An Example Demonstrating the Requirement of Fully Formal Verification Method
O
operational semantics	Using Esoteric Language for Teaching Formal Semantics
P
predicate discovery	Chekofv: Crowd-sourced Formal Verification
Process Engineering	Towards the Application of Formal Methods in Process Engineering
program transformations	Algebraic description of restricted programming and elements of its logics
proof checker	An Example Demonstrating the Requirement of Fully Formal Verification Method
R
Recurrence relation	Explaining the decompositionality of MSO using applications to combinatorics
S
Science Popularization	Fun With Formal Methods 2014: Opening Remarks
Signal-Flow-Graphs	Towards the Application of Formal Methods in Process Engineering
T
theorem proving	Towards the Application of Formal Methods in Process Engineering

Disclaimer | Powered by EasyChair Smart Program