279 search results - page 36 / 56 » Invariant Patterns for Program Reasoning |
CORR
2002
Springer
13 years 9 months ago
2002
Springer
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
PLILP
1993
Springer
14 years 1 months ago
1993
Springer
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
FLOPS
2008
Springer
13 years 11 months ago
2008
Springer
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
ICSE
2005
IEEE-ACM
14 years 9 months ago
2005
IEEE-ACM
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
POPL
1997
ACM
14 years 1 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...