Sciweavers

1724 search results - page 139 / 345
» Abstract Interpreters for Free
Sort
View
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
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
15 years 12 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
ENTCS
2002
125views more  ENTCS 2002»
15 years 6 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...
AUSAI
2007
Springer
16 years 20 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