Sciweavers

2496 search results - page 189 / 500
» Error-detecting properties of languages
Sort
View
LATA
2009
Springer
16 years 23 days ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
SCAM
2008
IEEE
16 years 11 days ago
Some Assembly Required - Program Analysis of Embedded System Code
Programming embedded system software typically involves more than one programming language. Normally, a high-level language such as C/C++ is used for application oriented tasks an...
Ansgar Fehnker, Ralf Huuck, Felix Rauch, Sean Seef...
CSR
2007
Springer
16 years 4 days ago
Marrying Words and Trees
Traditionally, data that has both linear and hierarchical structure, such as annotated linguistic data, is modeled using ordered trees and queried using tree automata. In this pap...
Rajeev Alur
GPCE
2007
Springer
16 years 4 days ago
Debugging macros
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...
Ryan Culpepper, Matthias Felleisen
ASPLOS
2006
ACM
15 years 12 months ago
Atomicity and visibility in tiny embedded systems
Visibility is a property of a programming language’s memory model that determines when values stored by one concurrent computation become visible to other computations. Our work...
John Regehr, Nathan Cooprider, David Gay