Sciweavers

1264 search results - page 177 / 253
» Abstract machines for programming language implementation
Sort
View
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 8 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
14 years 2 months ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson
AC
2003
Springer
14 years 1 months ago
A Mathematical Semantics for Architectural Connectors
Abstract. A mathematical semantics is proposed for the notion of architectural connector, in the style defined by Allen and Garlan, that builds on Goguen’s categorical approach t...
José Luiz Fiadeiro, Antónia Lopes, M...
GPCE
2003
Springer
14 years 1 months ago
Concept-Controlled Polymorphism
Concepts—sets of abstractions related by common requirements— have a central role in generic programming. This paper proposes a general framework for using concepts to control ...
Jaakko Järvi, Jeremiah Willcock, Andrew Lumsd...
WCRE
2000
IEEE
14 years 16 days ago
Exploring Legacy Systems using Types
We show how hypertext-based program understanding tools eve new levels of abstraction by using inferred type information for cases where the subject software system is written in ...
Arie van Deursen, Leon Moonen