6167 search results - page 271 / 1234 » Can Refinement be Automated |
163
Voted
TPHOL
1993
IEEE
15 years 11 months ago
1993
IEEE
Mathematical techniques can be used to produce precise, provably complete documentation for computer systems. However, such documents are highly detailed and oversights and other ...
183
click to vote
ALP
1994
Springer
15 years 11 months ago
1994
Springer
This paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. The logic is shown to be sound, complete and ...
155
Voted
CSL
2006
Springer
15 years 11 months ago
2006
Springer
We introduce a new class of multiplicative proof nets, J-proof nets, which are a typed version of Faggian and Maurel's multiplicative L-nets. In J-proof nets, we can character...
179
click to vote
KR
2000
Springer
15 years 11 months ago
2000
Springer
Acquiring information about its environment by sensing is a crucial ability of autonomous robots. Based on the established solution to the Frame Problem of the Fluent Calculus, we...
164
Voted
TPHOL
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper outlines a formal model of the Intel IA-64 architecture, and explains how this model can be used to verify the correctness of assembly-level code optimizations. The form...