8132 search results - page 133 / 1627 » Dependability, Abstraction, and Programming |
174
click to vote
AAECC
2007
Springer
15 years 6 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
151
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
222
click to vote
FROCOS
2011
Springer
14 years 6 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
147
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
High-level conditions are well-suited for expressing structural properties. They can describe the precondition and the postcondition for a high-level program, but they cannot descr...
149
click to vote
ICSE
2007
IEEE-ACM
16 years 6 months ago
2007
IEEE-ACM
The Verifying Compiler (VC) project is a core component of the Dependable Systems Evolution Grand Challenge. The VC offers the promise of automatically proving that a program or c...