Sciweavers

1226 search results - page 141 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
133
Voted
GCSE
1999
Springer
15 years 7 months ago
Scoping Constructs for Software Generators
Abstract. 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 mu...
Yannis Smaragdakis, Don S. Batory
126
Voted
IPPS
2009
IEEE
15 years 10 months ago
A component-based framework for the Cell Broadband Engine
With the increasing trend of microprocessor manufacturers to rely on parallelism to increase their products’ performance, there is an associated increasing need for simple techn...
Timothy D. R. Hartley, Ümit V. Çataly&...
PODC
2009
ACM
16 years 4 months ago
Randomized mutual exclusion in O(log N / log log N) RMRs
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
Danny Hendler, Philipp Woelfel
144
Voted
SIGSOFT
2003
ACM
15 years 8 months ago
Refinements and multi-dimensional separation of concerns
1 Step-wise refinement (SWR) asserts that complex programs can be derived from simple programs by progressively adding features. The length of a program specification is the number...
Don S. Batory, Jia Liu, Jacob Neal Sarvela
115
Voted
CAV
2007
Springer
121views Hardware» more  CAV 2007»
15 years 9 months ago
Algorithms for Interface Synthesis
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
Dirk Beyer, Thomas A. Henzinger, Vasu Singh