A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
A comparison of compilation techniques for trace monitors with free variables
2007
Companion to the 22nd ACM SIGPLAN conference on Object oriented programming systems and applications companion - OOPSLA '07
Preserved Fulltext
evaluation of the effectiveness of memory optimisations. ...
Here, we examine tradeoffs in simplicity of implementation and expressiveness of supported patterns, briefly discuss the underlying data structures of two mainstream implementations, and provide a short ...
Recall that with the alternative approach of annotating a single monitor instance with constraints, our space leak elimination determines how to handle each variable while it is on a given state, and this ...
doi:10.1145/1297846.1297905
dblp:conf/oopsla/AvgustinovTM07a
fatcat:762l7d5klrhihmnxi7uvaah2su
Anytime anyspace probabilistic inference
2005
International Journal of Approximate Reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper investigates methods that balance time and space constraints against the quality of Bayesian network inferences--we explore the three-dimensional spectrum of "time · space · quality" trade-offs ...
The main result of our investigation is the adaptive conditioning algorithm, an inference algorithm that works by dividing a Bayesian network into sub-networks and processing each sub-network with a combination ...
We thank two reviewers who gave important suggestions, and the editor, who oversaw this long process with great patience--particularly when waiting for us to produce the final version. ...
doi:10.1016/j.ijar.2004.04.001
fatcat:lrvtscaumvbuhny56scwycpn4e
Anytime anyspace probabilistic inference
2004
International Journal of Approximate Reasoning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper investigates methods that balance time and space constraints against the quality of Bayesian network inferences--we explore the three-dimensional spectrum of "time · space · quality" trade-offs ...
The main result of our investigation is the adaptive conditioning algorithm, an inference algorithm that works by dividing a Bayesian network into sub-networks and processing each sub-network with a combination ...
We thank two reviewers who gave important suggestions, and the editor, who oversaw this long process with great patience--particularly when waiting for us to produce the final version. ...
doi:10.1016/s0888-613x(04)00047-7
fatcat:yu4uqhddarcodfum3knugvam3i
Automatic Abstraction of Equations in a Logic of Equality
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
up to an order of magnitude relative to the e ij method where a new Boolean variable is used to encode each unique low-level equation between term variables. ...
The paper presents a method to automatically abstract equations when translating formulas with equality to equivalent Boolean formulas, allowing the use of a SAT-checker to determine the validity of the ...
The logic of Equality with Uninterpreted Functions and Memories (EUFM) [7] allows us to abstract functional units and memories, while completely modeling the control path of a processor. ...
doi:10.1007/978-3-540-45206-5_16
fatcat:kfigitubsfhztkugoeoqr3e62i
Automatic Test Data Generation and Model Checking with CHR
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We present an example for application of Constraint Handling Rules to automated test data generation and model checking in verification of mission critical software for satellite control. ...
Inequations are simplified using variable elimination very similar to Fourier-Motzkin-elimination. ...
Because the quality of elimination results for inequations depends on the order in which variables are eliminated, this process is at best difficult to implement for online processing. ...
arXiv:1406.2122v1
fatcat:dznbppvglnhsndvw3xfnwjqpii
BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It can also be used as an alternative to BDDbased model checking for systems with integer variables which have finite but large domains. ...
We argue that use of constraint-based model checking is not limited to infinite-state systems. ...
Acknowledgments This work was significantly improved by William Chan who provided insightful comments for an earlier draft of this paper and allowed access to his macros for interleaved variable order ...
doi:10.1007/3-540-46419-0_30
fatcat:gv2kvu54ovhrlphws7n2sstnaq
An exact method for analysis of value-based array data dependences
[chapter]
1994
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These techniques cannot be applied if they appear to a ect the ow dependences of a program. Second, it reduces the compiler's ability to make e ective use of caches or distributed memories. ...
We call a dependence between two references to the same memory location a memory-based dependence. ...
Negating Non-Convex Constraints To eliminate an integer variable x with Fourier-Motzkin variable elimination, we combine each upper and lower bound on x. ...
doi:10.1007/3-540-57659-2_31
fatcat:2lyh5d3szzbsveou4qflg5ps2m
TLSim and EVC: a term-level symbolic simulator and an efficient decision procedure for the logic of equality with uninterpreted functions and memories
2005
International Journal of Embedded Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An earlier version of our tool flow was used to formally verify a model of the M • CORE processor at Motorola, and detected bugs. ...
EVC exploits the property of Positive Equality and other optimisations in order to translate the EUFM formula to an equivalent Boolean formula that can be solved with any SAT procedure. ...
UPs are eliminated similarly, but using new Boolean variables. ...
doi:10.1504/ijes.2005.008815
fatcat:a7c2n3mtljdpbeujgwyhl2zq4i
Automated Transformation of GPU-Specific OpenCL Kernels Targeting Performance Portability on Multi-Core/Many-Core CPUs
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
local-memory arrays together with the obsolete barrier statements. ...
To solve this dilemma, we actively analyze the memory access patterns by using array-access descriptors derived from GPU-specific kernels, which can thus be adapted for CPUs by removing all the unwanted ...
+ Lid.x (4.3) So a transformation from local memory load to direct global memory load is legal, by performing the substitution of Lid.x with Iter k in (4.3), and using it to replace (4.2): f read AS = ...
doi:10.1007/978-3-319-09873-9_18
fatcat:uv3oeqsov5hexikm3dshib277e
Optimistic Parallel biscrete Relaxation
1993
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We illustrate this technique with the parallel implementation of a constraint satisfaction system that computes globally consistent solutions, and present performance numbers for experiments on a shared-memory ...
Discrete relaxation is frequently used to compute the fixed point of a discrete system where / is monotonic with respect to some partial order Given an appropriate initial value for X, discrete relaxation ...
shared-memory implementation. ...
dblp:conf/ijcai/HoHG93
fatcat:3mrv4zdqfzcmblvdc67yer3dt4
Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
2017
Constraints
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
in execution time (up to 345 times faster) with respect to a sequential version. ...
Inference-based algorithms are powerful techniques for solving discrete optimization problems, which can be used independently or in combination with other techniques. ...
GPU-based Variable Elimination We now describe the implementation of the variable elimination GPU kernel. ...
doi:10.1007/s10601-017-9274-1
fatcat:twvcfyzgajcilbd57lbqmxupda
Parallel inclusion-based points-to analysis
2010
Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
There is an extensive literature on how to speed up this algorithm using heuristics such as detecting and collapsing cycles of pointer-equivalent variables. ...
To the best of our knowledge, this is the first parallel implementation of a points-to analysis. ...
Acknowledgments The authors would like to thank Ben Hardekopf for generously providing the benchmarks used in our experiments and clarifying many aspects of his implementation. ...
doi:10.1145/1869459.1869495
dblp:conf/oopsla/Mendez-LojoMP10
fatcat:odr2owkqfre2pgbspingtgkqxu
Parallel inclusion-based points-to analysis
2010
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
There is an extensive literature on how to speed up this algorithm using heuristics such as detecting and collapsing cycles of pointer-equivalent variables. ...
To the best of our knowledge, this is the first parallel implementation of a points-to analysis. ...
Acknowledgments The authors would like to thank Ben Hardekopf for generously providing the benchmarks used in our experiments and clarifying many aspects of his implementation. ...
doi:10.1145/1932682.1869495
fatcat:m6vbu2jdtzev3mnqgyp4vezdyu
Making trace monitors feasible
2007
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In recent years trace monitors have been adapted for use with mainstream object-oriented languages. ...
While many language proposals exist for allowing such features, until now no implementation had scalable performance: execution on all but very simple examples was infeasible. ...
We had inspiring discussions with the authors of Java-MOP, Feng Chen and Grigore Roşu, which greatly clarified the relation between JavaMOP and tracematches. ...
doi:10.1145/1297105.1297070
fatcat:rfworuvx3bebploacqdynhtrba
Making trace monitors feasible
2007
Proceedings of the 22nd annual ACM SIGPLAN conference on Object oriented programming systems and applications - OOPSLA '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In recent years trace monitors have been adapted for use with mainstream object-oriented languages. ...
While many language proposals exist for allowing such features, until now no implementation had scalable performance: execution on all but very simple examples was infeasible. ...
We had inspiring discussions with the authors of Java-MOP, Feng Chen and Grigore Roşu, which greatly clarified the relation between JavaMOP and tracematches. ...
doi:10.1145/1297027.1297070
dblp:conf/oopsla/AvgustinovTM07
fatcat:if5nq5fok5ewffa6mha2iy4pp4
« Previous
Showing results 1 — 15 out of 150,711 results