Sciweavers

4940 search results - page 387 / 988
» On the Complexity of Universal Programs
Sort
View
GCSE
1999
Springer
15 years 11 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
C3S2E
2008
ACM
15 years 8 months ago
Concurrent software engineering: preparing for paradigm shift
Software systems bridge the gap between information processing needs and available computer hardware. As system requirements grow in complexity and hardware evolves, the gap does ...
Peter Grogono, Brian Shearing
CADE
2010
Springer
15 years 8 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 6 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...
ICDM
2010
IEEE
189views Data Mining» more  ICDM 2010»
15 years 4 months ago
S4: Distributed Stream Computing Platform
Abstract--S4 is a general-purpose, distributed, scalable, partially fault-tolerant, pluggable platform that allows programmers to easily develop applications for processing continu...
Leonardo Neumeyer, Bruce Robbins, Anish Nair, Anan...