391 search results - page 26 / 79 » Formal Universes |
114
click to vote
SAS
2001
Springer
15 years 4 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
86
Voted
FM
1994
Springer
15 years 4 months ago
1994
Springer
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
77
Voted
GI
2009
Springer
15 years 4 months ago
2009
Springer
Abstract: Voter privacy and verifiability are fundamental security concepts for electronic voting. Existing literature on electronic voting provides many definitions and interpreta...
110
Voted
AICCSA
2001
IEEE
15 years 4 months ago
2001
IEEE
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
106
click to vote
TYPES
2000
Springer
15 years 4 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...