Sciweavers

76 search results - page 8 / 16
» Reusing Proofs
Sort
View
ASM
2003
ASM
15 years 2 months ago
A Framework for Proving Contract-Equipped Classes
r in: Abstract State Machines 2003 — Advances in Theory and Applications, Proc. 10th International Workshop, Taormina, Italy, March 3-7, 2003, eds. Egon Boerger, Angelo Gargantin...
Bertrand Meyer
CADE
2005
Springer
15 years 10 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
FMCO
2009
Springer
120views Formal Methods» more  FMCO 2009»
14 years 7 months ago
A Framework for Reasoning on Component Composition
The main characteristics of component models is their strict structure enabling better code reuse. Correctness of component composition is well understood formally but existing wor...
Ludovic Henrio, Florian Kammüller, Muhammad U...
JSS
2007
105views more  JSS 2007»
14 years 9 months ago
Composing pattern-based components and verifying correctness
Designing large software systems out of reusable components has become increasingly popular. Although liberal composition of reusable components saves time and expense, many exper...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan, S...
ICALP
2005
Springer
15 years 3 months ago
About Hoare Logics for Higher-Order Store
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
Bernhard Reus, Thomas Streicher