The inherent difficulty of thread-based shared-memory programming has recently motivated research in high-level, task-parallel programming models. Recent advances of Task-Parallel models add implicit synchronization, where the system automatically detects and satisfies data dependencies among spawned tasks. However, dynamic dependence analysis incurs significant runtime overheads, because the r...

Although algebraic or so-called “implicit polynomial” curves have been studied rather extensively for several decades, to the best of our knowledge, a dynamic formulation of them, similar to active contours, has not been done yet. This paper develops a dynamic formulation for implicit polynomial curves based on level set formalism. In particular, it is shown that utilization of an implicit poly...

Dynamic taint analysis (DTA) is a powerful technique for, among other things, tracking the flow of sensitive information. However, it is vulnerable to false negative errors caused by implicit flows, situations in which tainted data values affect control flow, which in turn affects other data. We propose DTA++, an enhancement to dynamic taint analysis that additionally propagates taint along a t...

Ab&aet-Finite element procedures fur the dynamic analysis of fluid-structure systems are presented and evaluated. The fluid is assumed to be inviscid and compressible and is described using an updated &ran@an formulation. Variable-number-nodes isopammetric twoand threedimensional elements with hmtped or consistent mass idealization are employed in the finite element discretization, and the incr...

Separation logic is a concise method for specifying programs that manipulatedynamically allocated storage. Partially inspired by separation logic, Implicit DynamicFrames has recently been proposed, aiming at first-order tool support. In this paper,we precisely connect the semantics of these two logics. We define a logic whose syntaxsubsumes both that of a standard separation log...

This note is a case study for finding universal measures for weak implicit computational complexity. We will instantiate “universal measures” by “dynamic ordinals”, and “weak implicit computational complexity” by “bounded arithmetic”. Concretely, we will describe the connection between dynamic ordinals and witness oracle Turing machines for bounded arithmetic theories.

Although JavaScript is an important part of Web 2.0, it has historically been a major source of security holes. Code from malicious advertisers and cross-site-scripting (XSS) attacks are particularly pervasive problems. In this paper, we explore dynamic information flow to prevent the loss of confidential information from malicious JavaScript code. In particular, we extend prior dynamic informa...

the nonlinear static procedures (nsps) proposed by design codes do not lead to reliable results especially for tall buildings. they generally provide inconsistent estimates of inelastic seismic demands, especially for the top floors due to their inabilities in considering the higher modes effects. in this paper, a new enhanced pushover procedure is proposed which is based on the envelope of the...