Sciweavers

122 search results - page 22 / 25
» Abductive Logic Programming by Nonground Rewrite Systems
Sort
View
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
14 years 1 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
CADE
2004
Springer
14 years 10 months ago
Using Automated Theorem Provers to Certify Auto-generated Aerospace Software
Abstract. 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 ...
Bernd Fischer 0002, Ewen Denney, Johann Schumann
JOT
2008
200views more  JOT 2008»
13 years 10 months ago
Applying Model Checking to Concurrent UML Models
We present, in this paper, a framework supporting a formal verification of concurrent UML models using the Maude language. We consider both static and dynamic features of concurre...
Patrice Gagnon, Farid Mokhati, Mourad Badri
ENTCS
2007
108views more  ENTCS 2007»
13 years 10 months ago
Generating Java Compiler Optimizers Using Bidirectional CTL
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
Ling Fang, Masataka Sassa
JUCS
2006
104views more  JUCS 2006»
13 years 10 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...