Sciweavers

256 search results - page 4 / 52
» Using groups for investigating rewrite systems
Sort
View
89
Voted
ASE
2005
137views more  ASE 2005»
14 years 9 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
CSL
2009
Springer
15 years 4 months ago
On the Relation between Sized-Types Based Termination and Semantic Labelling
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
Frédéric Blanqui, Cody Roux
CSL
2010
Springer
14 years 9 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
CSCW
2012
ACM
13 years 5 months ago
Investigating effects of visual and tactile feedback on spatial coordination in collaborative handheld systems
Mobile and handheld devices have become platforms to support remote collaboration. But, their small form-factor may impact the effectiveness of the visual feedback channel often u...
Koji Yatani, Darren Gergle, Khai N. Truong
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
15 years 10 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold