265 search results - page 15 / 53 » How to Prove Inductive Theorems |
131
Voted
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
122
Voted
JUCS
2006
15 years 3 months ago
2006
: 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 ...
106
Voted
ISIPTA
2003
IEEE
15 years 9 months ago
2003
IEEE
In some situations, a decision is best represented by an incompletely analyzed act: conditionally to a certain event, the consequences of the decision on sub-events are perfectly ...
116
Voted
USS
2004
15 years 5 months ago
2004
It is well known that it is insecure to use the access(2) system call in a setuid program to test for the ability of the program's executor to access a file before opening sa...
144
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents experiments on common knowledge logic, conducted with the help of the proof assistant Coq. The main feature of common knowledge logic is the eponymous modality...