Sciweavers

547 search results - page 67 / 110
» On Automated Program Construction and Verification
Sort
View
TPHOL
2003
IEEE
15 years 3 months ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
IIE
2007
159views more  IIE 2007»
14 years 9 months ago
Creating and Visualizing Test Data from Programming Exercises
Automatic assessment of programming exercises is typically based on testing approach. Most automatic assessment frameworks execute tests and evaluate test results automatically, bu...
Petri Ihantola
66
Voted
JOT
2007
95views more  JOT 2007»
14 years 9 months ago
The Infer Type Refactoring and its Use for Interface-Based Programming
Interface-based programming, i.e. the systematic use of interface types in variable declarations, serves the decoupling of classes and increases a program’s changeability. To ma...
Friedrich Steimann
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
15 years 3 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
ASP
2003
Springer
15 years 2 months ago
Parametric Connectives in Disjunctive Logic Programming
Disjunctive Logic Programming (DLP) is an advanced formalism for Knowledge Representation and Reasoning (KRR). DLP is very expressive in a precise mathematical sense: it allows to ...
Nicola Leone, Simona Perri