4850 search results - page 202 / 970 » Proof and Computation in Geometry |
223
click to vote
CSL
2007
Springer
16 years 22 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
308
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
167
click to vote
ICTAC
2004
Springer
15 years 12 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
151
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
172
click to vote
FSE
2004
Springer
15 years 10 months ago
2004
Springer
ded abstract of this paper appears in Fast Software Encryption, FSE 2004, Lecture Notes in Computer Science, W. Meier and B. Roy editors, Springer-Verlag, 2004. This is the full ve...