1689 search results - page 57 / 338 » Refining abstract interpretations |
127
click to vote
CIE
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We show that the computational interpretation of full comprehension via two wellknown functional interpretations (dialectica and modified realizability) corresponds to t...
119
click to vote
TVLSI
2008
15 years 4 months ago
2008
Abstract--We present a refinement-based compositional framework for showing that pipelined machines satisfy the same safety and liveness properties as their non-pipelined specifica...
154
click to vote
INFORMATICALT
2010
15 years 1 months ago
2010
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several ...
128
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
d abstract) John Longley Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh The King's Buildings, Mayfield Road Edinburgh EH9 3JZ, U...
122
click to vote
ESSOS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present an approach to security requirements engineering, which makes use of special kinds of problem frames that serve to structure, characterize, analyze, and solve ...