Sciweavers

400 search results - page 51 / 80
» Reasoning About Hidden Mechanisms
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
14 years 9 months ago
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
Tobias Schmidt-Samoa
NJC
2006
86views more  NJC 2006»
14 years 9 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
ICSE
2011
IEEE-ACM
14 years 1 months ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst
ICFP
2006
ACM
15 years 9 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
ESOP
2004
Springer
15 years 3 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink