Sciweavers

94 search results - page 19 / 19
» Argumentation within deductive reasoning
Sort
View
ESEC
1999
Springer
13 years 10 months ago
Yesterday, My Program Worked. Today, It Does Not. Why?
Imagine some program and a number of changes. If none of these changes is applied (“yesterday”), the program works. If all changes are applied (“today”), the program does n...
Andreas Zeller
CIE
2008
Springer
13 years 8 months ago
Recursion on Nested Datatypes in Dependent Type Theory
Nested datatypes are families of datatypes that are indexed over all types and where the datatype constructors relate different members of the family. This may be used to represent...
Ralph Matthes
POPL
2008
ACM
14 years 6 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
SCAI
1993
13 years 7 months ago
A Case-Based Answer to Some Problems of Knowledge-Based Systems
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...
Agnar Aamodt