Sciweavers

759 search results - page 122 / 152
» Odometers on Regular Languages
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
ICSE
2005
IEEE-ACM
14 years 7 months ago
Binary refactoring: improving code behind the scenes
We present Binary Refactoring: a software engineering technique for improving the implementation of programs without modifying their source code. While related to regular refactor...
Eli Tilevich, Yannis Smaragdakis
LATA
2009
Springer
14 years 2 months ago
Bounded Hairpin Completion
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
Masami Ito, Peter Leupold, Victor Mitrana
VL
2009
IEEE
150views Visual Languages» more  VL 2009»
14 years 2 months ago
Discovery-based edit assistance for spreadsheets
Spreadsheets can be viewed as a highly flexible endusers programming environment which enjoys wide-spread adoption. But spreadsheets lack many of the structured programming conce...
Jácome Cunha, João Saraiva, Joost Vi...
ECOOP
2007
Springer
14 years 1 months ago
A Staged Static Program Analysis to Improve the Performance of Runtime Monitoring
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Our work is based on tracematches, an extension to...
Eric Bodden, Laurie J. Hendren, Ondrej Lhotá...