Sciweavers

1418 search results - page 119 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
15 years 9 months ago
A Tool for Checking ANSI-C Programs
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda
EMNLP
2009
15 years 2 months ago
Feature-Rich Translation by Quasi-Synchronous Lattice Parsing
We present a machine translation framework that can incorporate arbitrary features of both input and output sentences. The core of the approach is a novel decoder based on lattice...
Kevin Gimpel, Noah A. Smith
ECOOP
2006
Springer
15 years 8 months ago
A Semantic Analysis of C++ Templates
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
Jeremy G. Siek, Walid Taha
EUROSSC
2006
Springer
15 years 8 months ago
Infrastructural Support for Dynamic Context Bindings
Abstract. Research in context-aware systems shows that using context information enables the development of personalized mobile applications. The context acquisition process in a c...
Tom Broens, Aart van Halteren, Marten van Sinderen
ASPLOS
2009
ACM
16 years 5 months ago
Dynamic prediction of collection yield for managed runtimes
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
Michal Wegiel, Chandra Krintz