8132 search results - page 218 / 1627 » Dependability, Abstraction, and Programming |
185
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
297
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
137
click to vote
ATVA
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
153
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We address the verification problem of programs manipulating oneselector linked data structures. We propose a new automated approach for checking safety and termination f...
183
click to vote
ICSE
1997
IEEE-ACM
15 years 10 months ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...