Sciweavers

2944 search results - page 268 / 589
» On Well Quasi-orders on Languages
Sort
View
ISSTA
2009
ACM
16 years 1 months ago
Identifying semantic differences in AspectJ programs
Program differencing is a common means of software debugging. Although many differencing algorithms have been proposed for procedural and object-oriented languages like C and Ja...
Martin Th Görg, Jianjun Zhao
CLEF
2007
Springer
16 years 24 days ago
ParaMor: Finding Paradigms across Morphology
Our algorithm, ParaMor, fared well in Morpho Challenge 2007 (Kurimo et al., 2007), a peer operated competition pitting against one another algorithms designed to discover the morp...
Christian Monson, Jaime G. Carbonell, Alon Lavie, ...
TABLEAUX
2005
Springer
16 years 3 days ago
A Tableau-Based Explainer for DL Subsumption
This paper describes the implementation of a tableau-based reasoning component which is capable of providing quasi natural language explanations for subsumptions within ALEHFR+ TBo...
Thorsten Liebig, Michael Halfmann
PLDI
2004
ACM
16 years 1 days ago
Kill-safe synchronization abstractions
e Synchronization Abstractions “Well, it just so happens that your friend here is only mostly dead. There’s a big difference between mostly dead and all dead.” – Miracle Ma...
Matthew Flatt, Robert Bruce Findler
SEMWEB
2001
Springer
15 years 11 months ago
Open Learning Repositories and Metadata Modeling
Building repositories for e-learning is an iterative process and course content and course structure are always changing. We realized the necessity to separate content from structu...
Hadhami Dhraief, Wolfgang Nejdl, Boris Wolf, Marti...