Sciweavers

498 search results - page 43 / 100
» From Language to Time: A Temporal Expression Anchorer
Sort
View
CONCUR
2009
Springer
15 years 10 months ago
Time-Bounded Verification
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...
Joël Ouaknine, Alexander Rabinovich, James Wo...
APAL
2005
125views more  APAL 2005»
15 years 6 months ago
Dynamic topological logic
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...
Philip Kremer, Grigori Mints
RULEML
2007
Springer
16 years 7 days ago
Querying the Semantic Web with SWRL
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, ...
FATES
2003
Springer
15 years 11 months ago
Auto-generating Test Sequences Using Model Checkers: A Case Study
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 ...
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 10 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
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...
Olaf Chitil