A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Filters
Precise reasoning for programs using containers
2011
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '11
Preserved Fulltext
In this paper, we present a sound, precise, and fully automatic technique for static reasoning about contents of containers. ...
Since many applications written in modern programming languages, such as C++ and Java, use containers as standard building blocks, precise analysis of many programs requires a fairly sophisticated understanding ...
Acknowledgments We would like to thank Roy Frostig for his help with extending our front-end for the C language to C++. ...
doi:10.1145/1926385.1926407
dblp:conf/popl/DilligDA11
fatcat:ow6xzsfms5en7hdwqfdgcd4aiy
Precise reasoning for programs using containers
2011
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 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a sound, precise, and fully automatic technique for static reasoning about contents of containers. ...
Since many applications written in modern programming languages, such as C++ and Java, use containers as standard building blocks, precise analysis of many programs requires a fairly sophisticated understanding ...
Acknowledgments We would like to thank Roy Frostig for his help with extending our front-end for the C language to C++. ...
doi:10.1145/1925844.1926407
fatcat:hf6b4sbmvbdxlkbxbmahjtktcy
Development of automatically verifiable systems using data representation synthesis
2013
Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity - SPLASH '13
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.
Acknowledgments Thank you to Alex Aiken, Peter Hawkins, Tom & Isil Dillig, and Mooly Sagiv for guidance and support. ...
In particular we can use existing techniques for precise reasoning about containers to reason about DRS-generated relations. ...
Recent work by Dillig, Dillig, & Aiken developed a technique for precise automatic static analysis of container-manipulating programs, which we will refer to as Precise Container Reasoning (PCR) [2] . ...
doi:10.1145/2508075.2514874
dblp:conf/oopsla/Cronkite-Ratcliff13
fatcat:mmuu7nih4zbcnhmsfcito5e2jm
Loopfrog: A Static Analyzer for ANSI-C Programs
2009
2009 IEEE/ACM International Conference on Automated Software Engineering
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.
The first is model checking, which provides total precision, but suffers from the state space explosion problem. ...
We present LOOPFROG, a static analyzer that combines the best of both worlds: the precision of model checking and the performance of abstract interpretation. ...
This engine allows for bit-precise, symbolic reasoning without abstraction. In our context, it always gives a definite answer, since only loop-less program fragments are passed to it. ...
doi:10.1109/ase.2009.35
dblp:conf/kbse/KroeningSTTW09
fatcat:poe2zpq2d5cszia5ivp2mmmi3q
Staged concurrent program analysis
2010
Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering - FSE '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 2011; you can also visit the original URL.
The file type is application/pdf.
The first stage uses sequential program semantics to obtain a precise summary of each thread in terms of the global accesses made by the thread. ...
We have implemented our approach in the FUSION framework for checking concurrent C programs shows that avoiding redundant bi-modal reasoning makes the analysis more scalable. ...
We would like to thank the Verification group at NEC and the anonymous reviewers for their invaluable feedback. ...
doi:10.1145/1882291.1882301
dblp:conf/sigsoft/SinhaW10
fatcat:adxhqcqudzfgjmo43q2aucwtru
Understanding Program Slices
2012
Acta Cybernetica
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.
Program slicing is a useful analysis for aiding different software engineering activities. ...
Usability of program slicing for real world programs depends on many factors such as precision, speed, and scalability, which have already been addressed in the literature. ...
There are no fully precise static slicing methods for real programming languages, so false positives, i.e. slice elements identified on dependences that actually cannot occur during real program executions ...
doi:10.14232/actacyb.20.4.2012.2
fatcat:ngezwhbawnar3eghcoxzwtokiu
QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
[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 2017; you can also visit the original URL.
The file type is application/pdf.
As a library, it is useful for inferring relational data invariants in programs that manipulate data structures. ...
In this paper we present the architecture of the library, guidelines on how to select heuristics, and an example instantiation of the library using the Apron library to verify set-manipulating programs ...
This kind of reasoning is useful for a variety of applications: -Whole-program verification of container-manipulating programs -The QUICr library can reason about constants and known sets as well as unknown ...
doi:10.1007/978-3-319-08867-9_57
fatcat:2crmdxtazrg2zm4y7yxtghsbm4
Static Analysis of Shape in TensorFlow Programs (Artifact)
2020
Dagstuhl Artifacts Series (DARTS)
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.
These instructions are intended for using the artifact for our ECOOP'20 paper entitled "Static Analysis of Shape in TensorFlow Programs". ...
They can be used to run Pythia - the tool implementing the paper's analysis - on the paper's evaluation set demonstrating bug detection in the most precise configuration of our analysis as well as the ...
Content The artifact contains the Doop program analysis framework that includes Pythia, the dataset of "An empirical study on TensorFlow program bugs" [1] (part of which is our evaluation set), the full ...
doi:10.4230/darts.6.2.6
dblp:journals/darts/LagouvardosDGAS20
fatcat:xncs2fucc5drxnb3ayf4devxty
Lifting CDCL to Template-based Abstract Domains for Program Verification
[article]
2017
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 a novel lifting of CDCL to program analysis called Abstract Conflict Driven Learning for Programs (ACDLP). ...
We have imple- mented ACDLP for automatic bounded safety verification of C programs. ...
The key insight of ACDLP is to use decisions and learning to precisely reason about disjunctions in non-distributive domains, thereby automatically refining the precision of analysis for safety checking ...
arXiv:1707.02011v1
fatcat:sxk2gznl5rbn7juasvhbmtmbmy
ARVO-CL: The OpenCL version of the ARVO package — An efficient tool for computing the accessible surface area and the excluded volume of proteins via analytical equations
2012
Computer Physics Communications
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 2012; you can also visit the original URL.
The file type is application/pdf.
Another, more important reason is to use the possibilities for speeding-up provided by modern graphical cards. We also want to eliminate the necessity of re-compiling the program for every molecule. ...
For details of the algorithm, please read Refs. [3, 4] . In programming using OpenCL, more attention must be given to memory used than in a classical approach. ...
doi:10.1016/j.cpc.2012.04.019
fatcat:exs5v3nuwbf5llphya6v7mpaz4
A First-Order Logic with Frames
[chapter]
2020
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 2020; you can also visit the original URL.
The file type is application/pdf.
Finally, we design a program logic based on frame logic for reasoning with programs that dynamically update heaps that facilitates local specifications and frame reasoning. ...
Using such supports, we formulate proof rules that facilitate frame reasoning elegantly when the underlying model undergoes change. ...
Acknowledgements: We thank ESOP'20 reviewers for their comments that helped improve this paper. ...
doi:10.1007/978-3-030-44914-8_19
fatcat:xmdzlbfxzrb3bprfxmnvw3o54m
An overview of the Jahob analysis system: project goals and current status
2006
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
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 2006; you can also visit the original URL.
The file type is application/pdf.
It also incorporates new decision procedures for reasoning about sets with cardinality constraints. The system can infer loop invariants using new symbolic shape analysis. ...
It uses monadic secondorder logic over trees to reason about reachability in linked data structures, the Isabelle theorem prover and Nelson-Oppen style theorem provers to reason about high-level properties ...
We thank Thomas Wies, Karen Zee, Peter Schmitt, and Hai Huu Nguyen for contributions to the Jahob project. ...
doi:10.1109/ipdps.2006.1639580
dblp:conf/ipps/KuncakR06
fatcat:xqshphujjbfirf7v7kzjbf4acq
Conjunctive Abstract Interpretation Using Paramodulation
[chapter]
2017
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 2019; you can also visit the original URL.
The file type is application/pdf.
The algorithm was implemented and used for reasoning about low level programs. ...
Therefore, CNF formulae are commonly used in manual program verification and symbolic reasoning. ...
The key reason for the transformers we obtain to be the best abstract transformers, is that restricting our domain to contain only terms corresponding to program variables (i.e., constant symbols) ensures ...
doi:10.1007/978-3-319-52234-0_24
fatcat:bf5a4u5i7vcbtpxaajeqgxgsq4
Lifting CDCL to Template-Based Abstract Domains for Program Verification
[chapter]
2017
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 2019; you can also visit the original URL.
The file type is application/pdf.
We present a novel lifting of CDCL to program analysis called Abstract Conflict Driven Learning for Programs (ACDLP). ...
Our template polyhedra can express intervals, octagons and restricted polyhedral constraints over program variables. We have implemented ACDLP for automatic bounded safety verification of C programs. ...
with nested loops containing relational properties. ...
doi:10.1007/978-3-319-68167-2_21
fatcat:vr627k7yrrahhabdsuvlfro7am
RedCard: Redundant Check Elimination for Dynamic Race Detectors
[chapter]
2013
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.
Precise dynamic race detectors report an error if and only if an observed program trace exhibits a data race. ...
RedCard, our prototype implementation for the Java language, enables dynamic race detectors to reduce the number of run-time checks by close to 40% with no loss in precision. ...
We thank James Wilcox for his assistance on the experiments. ...
doi:10.1007/978-3-642-39038-8_11
fatcat:tmk74n7ssvdlbam3xee3bvzuke
« Previous
Showing results 1 — 15 out of 1,133,224 results