Results 1 - 10
of
17,622
Points-to Analysis in Almost Linear Time
, 1996
"... We present an interprocedural flow-insensitive points-to analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described. The algorithm is based on a non-s ..."
Abstract
-
Cited by 595 (3 self)
- Add to MetaCart
We present an interprocedural flow-insensitive points-to analysis based on type inference methods with an almost linear time cost complexity. To our knowledge, this is the asymptotically fastest non-trivial interprocedural points-to analysis algorithm yet described. The algorithm is based on a non
The SLAM project: debugging system software via static analysis
- SIGPLAN Not
"... Abstract. The goal of the SLAM project is to check whether or not a program obeys "API usage rules " that specif[y what it means to be a good client of an API. The SLAM toolkit statically analyzes a C program to determine whether or not it violates given usage rules. The toolkit has two un ..."
Abstract
-
Cited by 472 (17 self)
- Add to MetaCart
Abstract. The goal of the SLAM project is to check whether or not a program obeys "API usage rules " that specif[y what it means to be a good client of an API. The SLAM toolkit statically analyzes a C program to determine whether or not it violates given usage rules. The toolkit has two
LLVM: A compilation framework for lifelong program analysis & transformation
, 2004
"... ... a compiler framework designed to support transparent, lifelong program analysis and transformation for arbitrary programs, by providing high-level information to compiler transformations at compile-time, link-time, run-time, and in idle time between runs. LLVM defines a common, low-level code re ..."
Abstract
-
Cited by 852 (20 self)
- Add to MetaCart
... a compiler framework designed to support transparent, lifelong program analysis and transformation for arbitrary programs, by providing high-level information to compiler transformations at compile-time, link-time, run-time, and in idle time between runs. LLVM defines a common, low-level code
Gravity with Gravitas: a Solution to the Border Puzzle
, 2001
"... Gravity equations have been widely used to infer trade ow effects of various institutional arrangements. We show that estimated gravity equations do not have a theoretical foundation. This implies both that estimation suffers from omitted variables bias and that comparative statics analysis is unfo ..."
Abstract
-
Cited by 670 (4 self)
- Add to MetaCart
Gravity equations have been widely used to infer trade ow effects of various institutional arrangements. We show that estimated gravity equations do not have a theoretical foundation. This implies both that estimation suffers from omitted variables bias and that comparative statics analysis
Applying New Scheduling Theory to Static Priority Pre-Emptive Scheduling
- Software Engineering Journal
, 1993
"... The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) release ..."
Abstract
-
Cited by 448 (64 self)
- Add to MetaCart
The paper presents exact schedulability analyses for real-time systems scheduled at run-time with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions
DART: Directed automated random testing
- In Programming Language Design and Implementation (PLDI
, 2005
"... We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static source-code parsing; (2) automatic generation of a test driver for this interface that performs ..."
Abstract
-
Cited by 843 (42 self)
- Add to MetaCart
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static source-code parsing; (2) automatic generation of a test driver for this interface
Theory of Elasticity,
, 1951
"... ABSTRACT The knowledge of the in-situ stress field in rock masses is in general of crucial importance in various areas of geo-engineering, such as mining or civil underground excavations, hydrocarbon extraction, CO2 storage, hydraulic fracture operations, etc. In the context of the Finite Element ..."
Abstract
-
Cited by 710 (1 self)
- Add to MetaCart
Method, the in-situ stress conditions should be incorporated in the analysis following the generation of the FE mesh and prior to the consideration of the actions due to the engineering design The method described in this paper involves basically two steps. In the first one a first estimate
An almost ideal demand system.
- American Economic Review,
, 1980
"... Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from the ..."
Abstract
-
Cited by 636 (0 self)
- Add to MetaCart
for testing, extending, and improving conventional demand analysis. This does not imply that the system, particularly in its simple static form, is to be regarded as a fully satisfactory explanation of consumers' behavior. Indeed, by proposing a demand system which is superior to its predecessors, we
The structure of the potassium channel: molecular basis of K+ conduction and selectivity
- Science
, 1998
"... The potassium channel from Streptomyces lividans is an integral membrane protein with sequence similarity to all known K1 channels, particularly in the pore region. X-ray analysis with data to 3.2 angstroms reveals that four identical subunits create an inverted teepee, or cone, cradling the selecti ..."
Abstract
-
Cited by 460 (1 self)
- Add to MetaCart
The potassium channel from Streptomyces lividans is an integral membrane protein with sequence similarity to all known K1 channels, particularly in the pore region. X-ray analysis with data to 3.2 angstroms reveals that four identical subunits create an inverted teepee, or cone, cradling
Using Static Single Assignment Form to Improve Flow-Insensitive Pointer Analysis
- In Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
, 1998
"... A pointer-analysis algorithm can be either flow-sensitive or flow-insensitive. While flow-sensitive analysis usually provides more precise information, it is also usually considerably more costly in terms of time and space. The main contribution of this paper is the presentation of another option in ..."
Abstract
-
Cited by 50 (0 self)
- Add to MetaCart
in the form of an algorithm that can be `tuned' to provide a range of results that fall between the results of flow-insensitive and flow-sensitive analysis. The algorithm combines a flow-insensitive pointer analysis with static single assignment (SSA) form and uses an iterative process to obtain
Results 1 - 10
of
17,622