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
.
Filters
Counterexample-guided approach to finding numerical invariants
2017
Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2017
Finally, we show that NumInv performs competitively comparing to state of the art numerical invariant analysis tools. ...
Preliminary results show that NumInv generates required invariants for understanding and verifying correctness of programs involving complex arithmetic. ...
candidate equality relations among terms. ...
doi:10.1145/3106237.3106281
dblp:conf/sigsoft/NguyenARH17
fatcat:vrjt7mnfuze3po7yl37dwumgoi
For numerical invariants, DIG supports both nonlinear equalities and inequalities of arbitrary degree defined over numerical program variables. ...
For array invariants, DIG generates nested relations among multidimensional array variables. These properties are nontrivial and challenging for current static and dynamic invariant analysis methods. ...
We thank Matthias Horbach and Hengjun Zhao for insightful discussions as well as Xiang Yin for providing the AES implementation. ...
doi:10.1145/2556782
fatcat:yviant23dzaldptuzpd7g3zm2y
A Counterexample-guided Approach to Finding Numerical Invariants
[article]
2019
arXiv
pre-print
This design and the use of KLEE as a verifier allow NumInv to discover useful and important numerical invariants for many challenging programs. ...
Finally, we show that NumInv performs competitively comparing to state of the art numerical invariant analysis tools. ...
ACKNOWLEDGMENTS We thank the anonymous reviewers for their detailed feedback and helpful comments. is research was supported by DARPA under contracts FA8750-15-2-0104 and FA8750-16-C-0022. ...
arXiv:1903.12113v1
fatcat:d7uwtgfqtjgbpfnvtptmabhgue
Abstracting s-semantics using a model-theoretic approach
[chapter]
1994
Lecture Notes in Computer Science
A new approach for abstract interpretation of definite logic programs is introduced. The basic idea is to use an equality theory which safely approximates the Free Equality theory. ...
The non-Herbrand model generated from this theory is used for safely approximating the s-semantics of definite logic programs. ...
Acknowledgements We are grateful to Bart Demoen and Gerda Janssens for fruitful discussions. ...
doi:10.1007/3-540-58402-1_30
fatcat:htyqvrrgfbhatj4g6odupnqeqi
Using dynamic analysis to discover polynomial and array invariants
2012
2012 34th International Conference on Software Engineering (ICSE)
Using these methods, we show how to find equalities and inequalities among nonlinear polynomials over program variables, and linear relations among array variables of multiple dimensions. ...
Two useful forms of invariants involve relations among polynomials over program variables and relations among array variables. ...
We thank Xiang Yin for providing the AES implementation and Matthias Horbach for insightful discussions on early drafts of this work. ...
doi:10.1109/icse.2012.6227149
dblp:conf/icse/NguyenKWF12
fatcat:q2yihdfyinc6bbej5izmuo5j7y
On the complexity analysis of static analyses
2002
Journal of the ACM
This paper argues that for many algorithms, and static analysis algorithms in particular, bottom-up logic program presentations are clearer and simpler to analyze, for both correctness and complexity, ...
Although the variable counting bound gives an approriate analysis for the single transitivity rule, it turns out that variable counting is too crude for most algorithms. ...
Perhaps the most fundamental use of equality in program analysis is the use of unification in type inference for simple types. ...
doi:10.1145/581771.581774
fatcat:ums73yemifgb5gszjvxrw2c6om
On the Complexity Analysis of Static Analyses
[chapter]
1999
Lecture Notes in Computer Science
This paper argues that for many algorithms, and static analysis algorithms in particular, bottom-up logic program presentations are clearer and simpler to analyze, for both correctness and complexity, ...
Although the variable counting bound gives an approriate analysis for the single transitivity rule, it turns out that variable counting is too crude for most algorithms. ...
Perhaps the most fundamental use of equality in program analysis is the use of unification in type inference for simple types. ...
doi:10.1007/3-540-48294-6_21
fatcat:vvnmjzoxufep5idrur3pc525je
Transforming non textually aligned SPMD programs into textually aligned SPMD programs by using rewriting rules
2019
2019 International Conference on High Performance Computing & Simulation (HPCS)
So, we can benefit of a simple static analysis for deadlock detection. ...
For a special case of those programs with minimal SPMD (Single Program Multiple Data) constructs, a formal definition of textually aligned barriers with an operational semantics has been proposed in previous ...
Equality is a binary relation between terms meaning that the terms are identical, in the sense that replacement of one by the other in an expression does not change its value. ...
doi:10.1109/hpcs48598.2019.9188223
dblp:conf/ieeehpcs/Bousdira19
fatcat:g6o77nn7dbf6bbdaub5yyerpqy
Validating Library Usage Interactively
[chapter]
2013
Lecture Notes in Computer Science
Our analysis casts the problem of validating an optimization as an abductive inference problem in the context of checking program equivalence. ...
Our analysis solves the abductive equivalence problem by interacting with the programmer so that the programmer implements a solver for a logical theory that models library functions invoked by the program ...
over the library functions, and propagates the logical consequence of the equalities to the rest of the analysis. ...
doi:10.1007/978-3-642-39799-8_56
fatcat:wulx4wvkrrd6hgruk74tldnb5i
AN EXPLORATORY STUDY ON FACTORS INFLUENCING MAJOR SELECTION
2008
Issues in Information Systems
Despite the increased use of innovative computerrelated technologies, undergraduate students seem less interested in the technology-related majors, resulting in declining Information Systems (IS) program ...
After the analysis of our survey data, the response differences between high school and college students and between male and female students are reported. ...
Independent t-test Results Factors
Lavene's
Test
for Equality of
Variances
t-test
for
equality of
means
F
Sig. ...
doi:10.48009/1_iis_2008_168-175
fatcat:4bq54alugrestaa372e2gcocsq
egg: Fast and Extensible Equality Saturation
[article]
2020
arXiv
pre-print
Although they were originally developed in the late 1970s for use in automated theorem provers, a more recent technique known as equality saturation repurposes e-graphs to implement state-of-the-art, rewrite-driven ...
Our case studies on three previously published applications of equality saturation highlight how egg's performance and flexibility enable state-of-the-art results across diverse domains. ...
ACKNOWLEDGMENTS Thanks to our anonymous paper and artifact reviewers for their feedback. Special thanks to our shepherd Simon Peyton Jones, Leonardo de Moura, and many members of the PLSE group. ...
arXiv:2004.03082v3
fatcat:jqqec6vamnaejcl2fqw3tq2nyy
Balancing the Four Es; or Can We Achieve Equity for Social Equity in Public Administration?
2011
Journal of Public Affairs Education
the turn of this century, it still struggles to find its place as an equal among the traditional public administration values of economy, efficiency, and effectiveness. ...
The question to be addressed here is, "How do we elevate social equity to equal playing status with the other pillars of public administration?" ...
Through cost-benefit analysis, these studies have shown that the savings or social return on investment (SROI) to the public for these programs comes in the form of long-term reductions in educational ...
doi:10.1080/15236803.2011.12001640
fatcat:b3lltlowrbhrrpw4zrhpciiize
Supplemental Material, Nelson_etal_OnlineAppendix - The Future of Coding: A Comparison of Hand-Coding and Three Types of Computer-Assisted Text Analysis Methods
2018
Figshare
Supplemental Material, Nelson_etal_OnlineAppendix for The Future of Coding: A Comparison of Hand-Coding and Three Types of Computer-Assisted Text Analysis Methods by Laura K. ...
Notes: In all cases, to allow for plurals, we allow for optional trailing "-ies" for terms ending in "y" preceded by a consonant; trailing "-es" for terms ending in "ch", "s", or "x"; and trailing "-s" ...
At the time of analysis all three programs were being actively supported and updated. As of April 2018, RTextTools is no longer being actively supported and updated. ...
doi:10.25384/sage.6374291
fatcat:zbvcylhcezc7zhxf7lf7uhoeki
Conjunctive Abstract Interpretation Using Paramodulation
[chapter]
2017
Lecture Notes in Computer Science
Scaling static analysis is one of the main challenges for program verification in general and for abstract interpretation in particular. ...
However, for reasoning about equalities, the problem is somewhat easier since we can compactly represent equivalence classes and leverage the properties of equivalence relations and of function congruence ...
relational and disjunctive information, and the cost of the analysis. ...
doi:10.1007/978-3-319-52234-0_24
fatcat:bf5a4u5i7vcbtpxaajeqgxgsq4
OP127 Analysis Of The Competencies To Be Acquired In Health Technology Assessment
2017
International Journal of Technology Assessment in Health Care
CONCLUSIONS: The analyzed Masters degree courses and manuals did not cover all of the dimensions of HTA analysis in an equal and standardized way. ...
We used the HTAi vortal and the information related to courses (for example Masters degrees) and HTA agencies and network webpages for programs. ...
CONCLUSIONS: The analyzed Masters degree courses and manuals did not cover all of the dimensions of HTA analysis in an equal and standardized way. ...
doi:10.1017/s026646231700188x
fatcat:uf3tacoys5adticx3vs55hczmi
« Previous
Showing results 1 — 15 out of 1,936,551 results