Sciweavers

222 search results - page 21 / 45
» E-Matching with Free Variables
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
JAR
2006
236views more  JAR 2006»
13 years 7 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
PROMISE
2010
13 years 2 months ago
Modeling the relationship between software effort and size using deming regression
Background: The relation between software effort and size has been modeled in literature as exponential, in the sense that the natural logarithm of effort is expressed as a linear...
Nikolaos Mittas, Makrina Viola Kosti, Vasiliki Arg...
ESCIENCE
2006
IEEE
14 years 1 months ago
Using Lambda Networks to Enhance Performance of Interactive Large Simulations
— The ability to use a visualisation tool to steer large simulations provides innovative and novel usage scenarios, eg the ability to use new algorithms for the computation of fr...
Matt J. Harvey, Shantenu Jha, Mary-Ann Thyveetil, ...
CSL
2005
Springer
14 years 1 months ago
A Propositional Proof System for Log Space
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
Steven Perron