Sciweavers

1686 search results - page 106 / 338
» Programs as polygraphs: computability and complexity
Sort
View
ESOP
2005
Springer
15 years 3 months ago
Programming with Explicit Security Policies
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
Andrew C. Myers
IWPC
2002
IEEE
15 years 2 months ago
Building Program Understanding Tools Using Visitor Combinators
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
Arie van Deursen, Joost Visser
ESOP
2006
Springer
15 years 1 months ago
Type-Based Amortised Heap-Space Analysis
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
Martin Hofmann, Steffen Jost
VISSYM
2004
14 years 11 months ago
Software Landscapes: Visualizing the Structure of Large Software Systems
Modern object-oriented programs are hierarchical systems with many thousands of interrelated subsystems. Visualization helps developers to better comprehend these large and comple...
Michael Balzer, Andreas Noack, Oliver Deussen, Cla...
IJMMS
2008
90views more  IJMMS 2008»
14 years 9 months ago
Pair programming and the mysterious role of the navigator
Computer programming is generally understood to be highly challenging and since its inception a wide range of approaches, tools and methodologies have been developed to assist in ...
Sallyann Bryant, Pablo Romero, Benedict du Boulay