923 search results - page 79 / 185 » Proving the value of formal methods |
167
click to vote
POPL
1998
ACM
15 years 10 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
270
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
We present a formal model of memory that both captures the lowlevel features of C's pointers and memory, and that forms the basis for an expressive implementation of separati...
144
click to vote
IAT
2006
IEEE
16 years 6 days ago
2006
IEEE
Within many domains, among which biological and cognitive areas, multiple interacting processes occur among agents with dynamics that are hard to handle. Current approaches to ana...
231
click to vote
IFL
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
174
click to vote
CAV
2005
Springer
15 years 11 months ago
2005
Springer
Automaton-based static program analysis has proved to be an effective tool for bug finding. Current tools generally re-analyze a program from scratch in response to a change in t...