Sciweavers

142 search results - page 7 / 29
» Basic Syntactic Mutation
Sort
View
ALPIT
2008
IEEE
14 years 3 months ago
Tree Kernel-Based Semantic Relation Extraction Using Unified Dynamic Relation Tree
This paper proposes a Unified Dynamic Relation Tree (DRT) span for tree kernel-based semantic relation extraction between entity names. The basic idea is to apply a variety of lin...
Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zh...
AIML
2008
13 years 10 months ago
Modal logic of time division
A logic LTD is defined, inspired by [37]. It is syntactically like basic modal logic with an additional unary operator but it has an interval-based semantics on structures with arb...
Tero Tulenheimo
IGPL
2008
67views more  IGPL 2008»
13 years 8 months ago
Complete Axiomatisations of Properties of Finite Sets
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
Thomas Ågotnes, Michal Walicki
ICSE
2010
IEEE-ACM
14 years 1 months ago
From behaviour preservation to behaviour modification: constraint-based mutant generation
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...
Friedrich Steimann, Andreas Thies
VEE
2005
ACM
218views Virtualization» more  VEE 2005»
14 years 2 months ago
The pauseless GC algorithm
Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the ...
Cliff Click, Gil Tene, Michael Wolf