Sciweavers

797 search results - page 18 / 160
» Eliminating Proofs from Programs
Sort
View
103
Voted
AMAI
1999
Springer
14 years 9 months ago
From Logic Programming Towards Multi-Agent Systems
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
Robert A. Kowalski, Fariba Sadri
93
Voted
PLDI
2006
ACM
15 years 3 months ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
ENTCS
2006
113views more  ENTCS 2006»
14 years 9 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
HEURISTICS
2006
197views more  HEURISTICS 2006»
14 years 9 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa
APLAS
2006
ACM
15 years 3 months ago
Proof Abstraction for Imperative Languages
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
William L. Harrison