Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Dynamic Topological Logic provides a context for studying the confluence of the topological semantics for S4, based on topological spaces rather than Kripke frames; topological dy...
The SWRLTab is a development environment for working with SWRL rules in Protégé-OWL. It supports the editing and execution of SWRL rules. It also provides mechanisms to allow int...
Martin J. O'Connor, Samson W. Tu, Csongor Nyulas, ...
Use of model-checking approaches for test generation from requirement models have been proposed by several researchers. These approaches leverage the witness (or counter-example) ...
Mats Per Erik Heimdahl, Sanjai Rayadurgam, Willem ...
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...