Sciweavers

150 search results - page 10 / 30
» The Applicability of Logic Program Analysis and Transformati...
Sort
View
LOPSTR
1997
Springer
13 years 12 months ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
CADE
1998
Springer
13 years 12 months ago
A Proof Environment for the Development of Group Communication Systems
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...
Christoph Kreitz, Mark Hayden, Jason Hickey
IJAIT
2006
106views more  IJAIT 2006»
13 years 7 months ago
An Empirical Evaluation of Automated Theorem Provers in Software Certification
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
Ewen Denney, Bernd Fischer 0002, Johann Schumann
AGP
1997
IEEE
13 years 12 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
14 years 1 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto