Sciweavers

13383 search results - page 331 / 2677
» Abstractions from proofs
Sort
View
POPL
2008
ACM
16 years 7 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
POPL
1998
ACM
15 years 11 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
ACL
2010
15 years 4 months ago
Hunting for the Black Swan: Risk Mining from Text
In the business world, analyzing and dealing with risk permeates all decisions and actions. However, to date, risk identification, the first step in the risk management cycle, has...
Jochen L. Leidner, Frank Schilder
EDBT
2008
ACM
236views Database» more  EDBT 2008»
16 years 6 months ago
Virtualization and databases: state of the art and research challenges
ng the abstract view of computing resources from the implementation of these resources of indirection between abstract view and implementation of resources - Hides implementation d...
Ashraf Aboulnaga, Cristiana Amza, Kenneth Salem
BIRTHDAY
2005
Springer
16 years 9 days ago
Primitive Rewriting
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
Nachum Dershowitz