Sciweavers

10575 search results - page 1744 / 2115
» Programming Languages
Sort
View
CORR
2000
Springer
133views Education» more  CORR 2000»
15 years 6 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
ENTCS
2007
123views more  ENTCS 2007»
15 years 6 months ago
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Context-sensitive rewriting (CSR) is a restriction of rewriting which forbids reductions on selected arguments of functions. Proving termination of CSR is an interesting problem w...
Beatriz Alarcón, Raúl Gutiérr...
IFM
2010
Springer
124views Formal Methods» more  IFM 2010»
15 years 5 months ago
Safe Commits for Transactional Featherweight Java
Abstract. Transactions are a high-level alternative for low-level concurrencycontrol mechanisms such as locks, semaphores, monitors. A recent proposal for integrating transactional...
Thi Mai Thuong Tran, Martin Steffen
OOPSLA
2010
Springer
15 years 5 months ago
Refactoring references for library migration
This report is a companion to the paper “Refactoring References for Library Migration” published at the ACM SIGPLAN International Conference on Systems, Programming, Languages...
Puneet Kapur, Bradley Cossette, Robert J. Walker
IGARSS
2010
15 years 1 months ago
The microasar experiment on CASIE-09
During the summer of 2009, the Characterization of Arctic Sea Ice Experiment 2009 (CASIE-09) operated a small, unmanned aircraft system (UAS) over the Arctic Ocean for a number of ...
David G. Long, Evan C. Zaugg, Matthew C. Edwards, ...
« Prev « First page 1744 / 2115 Last » Next »