Sciweavers

3573 search results - page 51 / 715
» Reasoning about Codata
Sort
View
106
Voted
LFCS
2007
Springer
15 years 5 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
SIGADA
2007
Springer
15 years 5 months ago
Using SPARK for a beginner's course on reasoning about imperative programs
Teaching beginners predicate transformer semantics for imperative languages is not a trivial task. For Computer Science majors, the teaching of the theoretical material must be su...
Kung-Kiu Lau
TACAS
2007
Springer
67views Algorithms» more  TACAS 2007»
15 years 5 months ago
A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes
Ahmed Bouajjani, Yan Jurski, Mihaela Sighireanu