407 search results - page 79 / 82 » Automatic Correctness Proofs for Logic Program Transformatio... |
137
click to vote
DLT
2006
15 years 4 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
112
click to vote
EUROSYS
2008
ACM
15 years 12 months ago
2008
ACM
The internal libraries of Linux are evolving rapidly, to address new requirements and improve performance. These evolutions, however, entail a massive problem of collateral evolut...
136
click to vote
TCS
2002
15 years 2 months ago
2002
This paper discusses a mathematical concept of language that models both artificial and natural languages and thus provides a framework for a unified language processing methodolo...
132
click to vote
PLDI
2006
ACM
15 years 8 months ago
2006
ACM
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
239
click to vote
POPL
2003
ACM
16 years 3 months ago
2003
ACM
There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom...