Sciweavers

4814 search results - page 178 / 963
» Combining abstract interpreters
Sort
View
CIE
2010
Springer
15 years 4 months ago
Proofs, Programs, Processes
Abstract. We study a realisability interpretation for inductive and coinductive definitions and discuss its application to program extraction from proofs. A speciality of this inte...
Ulrich Berger, Monika Seisenberger
DM
2011
318views Education» more  DM 2011»
15 years 1 months ago
The Legendre-Stirling numbers
Abstract. The Legendre-Stirling numbers were discovered in 2002 as a result of a problem involving the spectral theory of powers of the classical second-order Legendre di¤erential...
George E. Andrews, Wolfgang Gawronski, Lance L. Li...
POPL
2008
ACM
16 years 6 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
ICFP
2006
ACM
16 years 6 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
AUSAI
2007
Springer
16 years 19 days ago
The Semantic Representation of Temporal Expressions in Text
Abstract. Temporal expressions—references to points in time or periods of time—are widespread in text, and their proper interpretation is essential for any natural language pro...
Robert Dale, Pawel P. Mazur