Sciweavers

4281 search results - page 83 / 857
» How to Disembed a Program
Sort
View
DAGSTUHL
1996
13 years 9 months ago
An Automatic Interprocedural Analysis for the Understanding of Scientific Application Programs
This paper reports on an approachfor improvingthe understandingof old programs which have become very complex due to numerous extensions. We have adapted partial evaluation techni...
Sandrine Blazy, Philippe Facon
KRDB
1996
123views Database» more  KRDB 1996»
13 years 9 months ago
Flexible Query-Answering Systems Modelled in Metalogic Programming
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
Troels Andreasen, Henning Christiansen
ENTCS
2008
139views more  ENTCS 2008»
13 years 7 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
ENTCS
2006
94views more  ENTCS 2006»
13 years 7 months ago
Reasoning About Partial Functions in the Formal Development of Programs
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a numbe...
Cliff B. Jones
JGO
2008
83views more  JGO 2008»
13 years 7 months ago
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
Lewis Ntaimo, Matthew W. Tanner