79 search results - page 4 / 16 » Structural Abstraction of Software Verification Conditions |
114
Voted
VMCAI
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
103
Voted
SEFM
2009
IEEE
15 years 7 months ago
2009
IEEE
—Increasingly, tools and their underlying theories are able to cope with “real code” written as part of industrial grade applications almost as is. It has been our experience...
116
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these...
119
Voted
APN
2006
Springer
15 years 3 months ago
2006
Springer
Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verif...
118
Voted
COMGEO
2010
ACM
15 years 1 months ago
2010
ACM
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...