2 citations · 4 across the 6 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.PL2014
Abstracting an operational semantics to finite automata
Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus +1
There is an apparent similarity between the descriptions of small-step operational semantics of imperative programs and the semantics of finite automata, so defining an abstraction…
cs.LO2014
SROIQsigma is decidable
Jon Haël Brenas, Rachid Echahed, Martin Strecker
We consider a dynamic extension of the description logic . This means that interpretations could evolve thanks to some actions such as addition and/or deletion of…