Sciweavers

1205 search results - page 49 / 241
» Program Extraction from Large Proof Developments
Sort
View
ECBS
2005
IEEE
88views Hardware» more  ECBS 2005»
14 years 4 months ago
Integrative Architecture Elicitation for Large Computer Based Systems
Large and complex computer based systems are the result of an evolution process which may take many years. Heterogeneity is an important characteristic of such systems: During the...
Peter Tabeling, Bernhard Gröne
NMR
2004
Springer
14 years 4 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski
SOFSEM
2009
Springer
14 years 8 months ago
From Outermost Termination to Innermost Termination
Abstract. Rewriting is the underlying evaluation mechanism of functional programming languages. Therefore, termination analysis of term rewrite systems (TRSs) is an important techn...
René Thiemann
CADE
2011
Springer
12 years 11 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
CEC
2008
IEEE
14 years 5 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...