Sciweavers

1587 search results - page 231 / 318
» The Semantics of Extended SOFL
Sort
View
JAR
2008
81views more  JAR 2008»
13 years 9 months ago
Automatic Symmetry Detection for Promela
We introduce a specification language, Promela-Lite, which captures the essential features of Promela but which, unlike Promela, has a formally defined semantics. We show how we ca...
Alastair F. Donaldson, Alice Miller
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 9 months ago
Association Rules in the Relational Calculus
One of the most utilized data mining tasks is the search for association rules. Association rules represent significant relationships between items in transactions. We extend the...
Oliver Schulte, Flavia Moser, Martin Ester, Zhiyon...
JUCS
2008
138views more  JUCS 2008»
13 years 9 months ago
A Lightweight and Extensible AspectJ Implementation
Abstract: Extending AspectJ to experiment with new language features can be cumbersome, even with an extensible implementation. Often, a language designer only needs a rapid protot...
Rodolfo Toledo, Éric Tanter
ENTCS
2007
134views more  ENTCS 2007»
13 years 9 months ago
A Compact Linear Translation for Bounded Model Checking
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
Paul B. Jackson, Daniel Sheridan
ENTCS
2007
102views more  ENTCS 2007»
13 years 9 months ago
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
Brigitte Pientka