1799 search results - page 145 / 360 » The Logic of Correctness in Software Engineering |
201
click to vote
JACM
2002
15 years 6 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
295
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
We present a proof calculus and method for the static verification of assertions and procedure specifications in shared-memory concurrent programs. The key idea in our approach is...
201
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
147
click to vote
NLDB
2005
Springer
15 years 12 months ago
2005
Springer
Requirements engineering is the Achilles’ heel of the whole software development process, because requirements documents are often inconsistent and incomplete. Misunderstandings ...
271
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...