Results 1  10
of
2,673
Supporting Timing Analysis by Automatic Bounding of Loop Iterations
 Journal of RealTime Systems
, 2000
"... . Static timing analyzers, which are used to analyze realtime systems, need to know the minimum and maximum number of iterations associated with each loop in a realtime program so accurate timing predictions can be obtained. This paper describes three complementary methods to support timing analy ..."
Abstract

Cited by 47 (7 self)
 Add to MetaCart
analysis by bounding the number of loop iterations. First, an algorithm is presented that determines the minimum and maximum number of iterations of loops with multiple exits. Even when the number of iterations cannot be exactly determined, it is desirable to know the lower and upper iteration bounds
A training algorithm for optimal margin classifiers
 PROCEEDINGS OF THE 5TH ANNUAL ACM WORKSHOP ON COMPUTATIONAL LEARNING THEORY
, 1992
"... A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented. The technique is applicable to a wide variety of classifiaction functions, including Perceptrons, polynomials, and Radial Basis Functions. The effective number of parameters is adjust ..."
Abstract

Cited by 1865 (43 self)
 Add to MetaCart
is adjusted automatically to match the complexity of the problem. The solution is expressed as a linear combination of supporting patterns. These are the subset of training patterns that are closest to the decision boundary. Bounds on the generalization performance based on the leaveoneout method and the VC
AUTOMATIC BOUNDING ESTIMATION IN MODIFIED NLMS ALGORITHM
, 1999
"... Abstract Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on setmembership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular c ..."
Abstract
 Add to MetaCart
Abstract Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on setmembership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular
Automatic Symbolic Verification of Embedded Systems
, 1996
"... We present a modelchecking procedure and its implementation for the automatic verification of embedded systems. The system components are described as Hybrid Automata  communicating machines with finite control and realvalued variables that represent continuous environment parameters such as tim ..."
Abstract

Cited by 330 (24 self)
 Add to MetaCart
We present a modelchecking procedure and its implementation for the automatic verification of embedded systems. The system components are described as Hybrid Automata  communicating machines with finite control and realvalued variables that represent continuous environment parameters
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the ChurchRosser Theorem
 INDAG. MATH
, 1972
"... In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occurrences. This convention is known to cause considerable trouble in cases of substitution. In the present paper a different notational system is ..."
Abstract

Cited by 369 (1 self)
 Add to MetaCart
In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occurrences. This convention is known to cause considerable trouble in cases of substitution. In the present paper a different notational system
Korat: Automated testing based on Java predicates
 IN PROC. INTERNATIONAL SYMPOSIUM ON SOFTWARE TESTING AND ANALYSIS (ISSTA
, 2002
"... This paper presents Korat, a novel framework for automated testing of Java programs. Given a formal specification for a method, Korat uses the method precondition to automatically generate all nonisomorphic test cases bounded by a given size. Korat then executes the method on each of these test case ..."
Abstract

Cited by 331 (53 self)
 Add to MetaCart
This paper presents Korat, a novel framework for automated testing of Java programs. Given a formal specification for a method, Korat uses the method precondition to automatically generate all nonisomorphic test cases bounded by a given size. Korat then executes the method on each of these test
Appears in ACM SIGGRAPH Asia 2009 Automatic Bounding of Programmable Shaders for Efficient Global Illumination
"... the KajiyaKay shader (left); a glossy ball with a marblelike pattern generated by a procedural shader (center); a pillow using a shader that implements a spatially varying BRDF (right). (l), (r) are rendered with multidimensional lightcuts, and (c) is rendered using photon mapping. This paper desc ..."
Abstract
 Add to MetaCart
based rendering algorithms simulate the complex global flow of light through an environment but rely on higher level information about the material properties, such as importance sampling and bounding, to intelligently solve high dimensional rendering integrals. We propose using a compiler to automatically
UPPAAL  a Tool Suite for Automatic Verification of RealTime Systems
, 1996
"... . Uppaal is a tool suite for automatic verification of safety and bounded liveness properties of realtime systems modeled as networks of timed automata. It includes: a graphical interface that supports graphical and textual representations of networks of timed automata, and automatic transformation ..."
Abstract

Cited by 244 (15 self)
 Add to MetaCart
. Uppaal is a tool suite for automatic verification of safety and bounded liveness properties of realtime systems modeled as networks of timed automata. It includes: a graphical interface that supports graphical and textual representations of networks of timed automata, and automatic
Bounded Model Checking Using Satisfiability Solving
 Formal Methods in System Design
, 2001
"... The phrase model checking refers to algorithms for exploring the state space of a transition system to determine if it obeys a specification of its intended behavior. These algorithms can perform exhaustive verification in a highly automatic manner, and, thus, have attracted much interest in indus ..."
Abstract

Cited by 195 (3 self)
 Add to MetaCart
The phrase model checking refers to algorithms for exploring the state space of a transition system to determine if it obeys a specification of its intended behavior. These algorithms can perform exhaustive verification in a highly automatic manner, and, thus, have attracted much interest
Bounded model checking
, 2009
"... Besides Equivalence Checking [KK97, KPKG02] the most important industrial application of SAT is currently Bounded Model Checking (BMC) [BCCZ99]. Both techniques are used for formal hardware verification in the context of electronic design automation (EDA), but have successfully been applied to many ..."
Abstract

Cited by 165 (3 self)
 Add to MetaCart
Besides Equivalence Checking [KK97, KPKG02] the most important industrial application of SAT is currently Bounded Model Checking (BMC) [BCCZ99]. Both techniques are used for formal hardware verification in the context of electronic design automation (EDA), but have successfully been applied to many
Results 1  10
of
2,673