1226 search results - page 37 / 246 » Proofs, Programs and Abstract Complexity |
126
Voted
POPL
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
123
Voted
ITP
2010
15 years 6 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
108
Voted
MCU
2004
15 years 4 months ago
2004
Abstract. This paper provides a framework enabling to define and determine the complexity of various universal programs U for various machines. The approach consists of first defin...
134
Voted
KBSE
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—Test coverage such as branch coverage is commonly measured to assess the sufficiency of test inputs. To reduce tedious manual efforts in generating high-covering test i...
108
click to vote
ICSM
1996
IEEE
15 years 6 months ago
1996
IEEE
It is well known that the extensive use of preprocessors can lead to serious maintenance problems. However, these tools are still heavily used by developers and maintainers to imp...