Results 1  10
of
10,228
Adding Trace Matching with Free Variables to AspectJ
 In OOPSLA ’05: Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming, systems, languages, and applications
, 2005
"... An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspect can make are confined to the current action: it is not possible to directly observe the history of a computation. Recen ..."
Abstract

Cited by 163 (10 self)
 Add to MetaCart
by specifying a regular pattern of events in a computation trace. We have fully designed and implemented tracematches as a seamless extension of AspectJ. A key innovation in our tracematch approach is the introduction of free variables in the matching patterns. This enhancement enables a whole new class
Ematching with free variables.
, 2012
"... Abstract. Ematching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers, which are matched during proof search on ground terms to discover relevant instantiations of the quantified fo ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. In contrast, free variable methods in tableaulike calculi are more robust and give rise to complete procedures, e.g., for firstorder logic, but are not comparable to ematching in terms of scalability. This paper discusses how ematching can be combined with free variable approaches, leading to calculi
Solving QBF with Free Variables
"... Abstract. An open quantified boolean formula (QBF) is a QBF that contains free (unquantified) variables. A solution to such a QBF is a quantifierfree formula that is logically equivalent to the given QBF. Although most recent QBF research has focused on closed QBF, there are a number of interesting ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. An open quantified boolean formula (QBF) is a QBF that contains free (unquantified) variables. A solution to such a QBF is a quantifierfree formula that is logically equivalent to the given QBF. Although most recent QBF research has focused on closed QBF, there are a number
Free Variable Economy
"... Several authors have recently argued that semantic interpretation is subject to economy constraints. In particular, Fox (1999) argued that the interpretation of pronouns is subject to binding economy, which favors local binding over nonlocal binding. The present paper points out a problem for bindi ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
for binding economy. The aim, then, is to see if this problem can be resolved in a conservative way, that is, preserving the general idea that interpretation is subject to economy constraints. The suggested solution is to consider a different economy criterion. The proposed constraint, free variable economy
Incremental closure of free variable tableaux
 Proc. Intl. Joint Conf. on Automated Reasoning IJCAR
, 2001
"... Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures using free variable tableaux require iterative deepening and backtracking over applied instantiations to guarantee complete ..."
Abstract

Cited by 35 (6 self)
 Add to MetaCart
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures using free variable tableaux require iterative deepening and backtracking over applied instantiations to guarantee
Free Variable Types
"... Higherorder abstract syntax (HOAS) has been shown to be useful in formal systems for reasoning about programming languages. How to recurse over HOAS representations, however, is a wellknown problem. This is because, in most current systems, it is generally impossible to recurse on the body of a λ ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
as they can be shown not to escape their scope. Current systems cannot show these do not escape their scope without a runtime check. In this paper, we propose a novel type system that allows explicit reasoning about free variables. This type system can ensure these fresh variables do not escape their scopes
Negative Subgoals with Free Variables
 Journal of Logic Programming
"... Prolog systems currently work with the restriction that negative subgoals not contain free variables, although some authors have suggested that this restriction can be lifted by running the theorem prover to exhaustion on the subgoal being considered. We suggest that this approach is likely not to b ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Prolog systems currently work with the restriction that negative subgoals not contain free variables, although some authors have suggested that this restriction can be lifted by running the theorem prover to exhaustion on the subgoal being considered. We suggest that this approach is likely
A View Of The Em Algorithm That Justifies Incremental, Sparse, And Other Variants
 Learning in Graphical Models
, 1998
"... . The EM algorithm performs maximum likelihood estimation for data in which some variables are unobserved. We present a function that resembles negative free energy and show that the M step maximizes this function with respect to the model parameters and the E step maximizes it with respect to the d ..."
Abstract

Cited by 993 (18 self)
 Add to MetaCart
. The EM algorithm performs maximum likelihood estimation for data in which some variables are unobserved. We present a function that resembles negative free energy and show that the M step maximizes this function with respect to the model parameters and the E step maximizes it with respect
Numerical Solutions of the Euler Equations by Finite Volume Methods Using RungeKutta TimeStepping Schemes
, 1981
"... A new combination of a finite volume discretization in conjunction with carefully designed dissipative terms of third order, and a Runge Kutta time stepping scheme, is shown to yield an effective method for solving the Euler equations in arbitrary geometric domains. The method has been used to deter ..."
Abstract

Cited by 517 (78 self)
 Add to MetaCart
to determine the steady transonic flow past an airfoil using an O mesh. Convergence to a steady state is accelerated by the use of a variable time step determined by the local Courant member, and the introduction of a forcing term proportional to the difference between the local total enthalpy and its free
Practical Inlining of Functions with Free Variables
"... A longstanding practical challenge in the optimization of higherorder languages is inlining functions with free variables. Inlining code statically at a function call site is safe if the compiler can guarantee that the free variables have the same bindings at the inlining point as they do at the ..."
Abstract
 Add to MetaCart
A longstanding practical challenge in the optimization of higherorder languages is inlining functions with free variables. Inlining code statically at a function call site is safe if the compiler can guarantee that the free variables have the same bindings at the inlining point as they do
Results 1  10
of
10,228