Searching for authors named "Yannis Smaragdakis" – sorted by Relevance.
54 documents found, showing 1 through 10.
Next 10 →
-
Layered development with (Unix) dynamic libraries. Lecture
- …Layered software development has demonstrably good reuse properties and offers one of the few promising approaches to addressing the library scalability problem. In this paper, we show how one can develop layered software using common Unix (Linux/Solaris) dynamic libraries. In particular, we sho…
- Cited by 1 (0 self) – Add To MetaCart
-
Trace Reduction for LRU-based Simulations
- …LRU buffer management is a policy under which an element buffer of size k always stores the k most recently used elements. Many variants of the policy are widely used in memory systems (e.g., virtual memory subsystems). We study a simple algorithmic problem (called the trace reduction problem): give…
- Cited by 2 (1 self) – Add To MetaCart
-
General Adaptive Replacement Policies
- …We propose a general scheme for creating adaptive replacement policies with good performance and strong theoretical guarantees. Specifically, we show how to combine any two existing replacement policies so that the resulting policy provably can never perform worse than either of the original policie…
- Cited by 1 (1 self) – Add To MetaCart
-
Static Interfaces in C++
- …We present an extensible framework for defining and using "static interfaces" in C++. Static interfaces are especially useful as constraints on template parameters. That is, in addition to the usual template
, template definitions can specify that T "isa" Foo, for some static interface name… - Cited by 11 (1 self) – Add To MetaCart
-
Application Generators
- …Introduction When a programming activity is well-understood, it can be automated. Automation transforms software development from activities like rote coding and tedious debugging to that of specification, where the "what" of an application is declared and the "how" is left to a complex, but automa…
- Cited by 11 (1 self) – Add To MetaCart
-
Combining static and dynamic reasoning for bug detection
- …Abstract. Many static and dynamic analyses have been developed to improve program quality. Several of them are well known and widely used in practice. It is not entirely clear, however, how to put these analyses together to achieve their combined benefits. This paper reports on our experiences with …
- Cited by 1 (1 self) – Add To MetaCart
-
Functional Programming with the FC++ Library
- …this paper, "polymorphism" means parametric polymorphism by default…
- Cited by 5 (1 self) – Add To MetaCart
-
Scoping Constructs for Software Generators
- …. A well-known problem in program generation is scoping. When identifiers (i.e., symbolic names) are used to refer to variables, types, or functions, program generators must ensure that generated identifiers are bound to their intended declarations. This is the standard scoping issue in programming …
- Cited by 2 (0 self) – Add To MetaCart
-
Automatic Application Partitioning: The J-Orchestra approach
- …Application partitioning is the task of breaking up the functionality of an application into distinct entities that can operate independently, usually in a distributed setting. Many distributed applications are created by partitioning their centralized versions. Traditional application partitionin…
- Cited by 6 (3 self) – Add To MetaCart
-
Performing Replacement in Modem Pools
- …We examine a policy for managing modem pools that disconnects users only if not enough modems are available for other users to connect. Managing the modem pool then becomes a replacement problem, similar to buffer cache management (e.g., in virtual memory systems) . When a new connection request is …
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
