Searched for keywords.author.keyword:"empirical software validation" OR acmdlCCS:"empirical software validation"  [new search]  [edit/save query]  [advanced search]
Searched The ACM Full-Text Collection: 559,203 records   [Expand your search to The ACM Guide to Computing Literature: 2,853,851 records] Help: ACM vs. Guide
Refinements  [remove all]  click each refinement below to remove
Authors: Lerner, Sorin
7 results found
Export Results: bibtexendnoteacmrefcsv

Refine by People
Names show/hide
Institutions show/hide
Authors show/hide
Refine by Publications
Publication Names show/hide
ACM Publications show/hide
All Publications show/hide
Content Formats show/hide
Publishers show/hide
Refine by Conferences
Sponsors show/hide
Events show/hide
Proceeding Series show/hide
Refine by Publication Year
2003
Result 1 – 7 of 7
Sort by:

1 published by ACM
June 2008 PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 23
Downloads (6 Weeks): 10,   Downloads (12 Months): 20,   Downloads (Overall): 808

Full text available: PDFPDF
Dataflow analyses for concurrent programs differ from their single-threaded counterparts in that they must account for shared memory locations being overwritten by concurrent threads. Existing dataflow analysis techniques for concurrent programs typically fall at either end of a spectrum: at one end, the analysis conservatively kills facts about all data ...
Keywords: locksets, multithreaded programs, summaries, interprocedural analysis
Also published in:
May 2008  ACM SIGPLAN Notices - PLDI '08: Volume 43 Issue 6, June 2008
[result highlights]

2 published by ACM
October 2010 CCS '10: Proceedings of the 17th ACM conference on Computer and communications security
Publisher: ACM
Bibliometrics:
Citation Count: 50
Downloads (6 Weeks): 6,   Downloads (12 Months): 89,   Downloads (Overall): 1,484

Full text available: PDFPDF
The dynamic nature of JavaScript web applications has given rise to the possibility of privacy violating information flows. We present an empirical study of the prevalence of such flows on a large number of popular websites. We have (1) designed an expressive, fine-grained information flow policy language that allows us ...
Keywords: JavaScript, dynamic analysis, history sniffing, information flow, privacy, rewriting, web application, web security
[result highlights]

3 published by ACM
June 2009 PLDI '09: Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 91
Downloads (6 Weeks): 6,   Downloads (12 Months): 48,   Downloads (Overall): 1,215

Full text available: PDFPDF
Modern websites are powered by JavaScript, a flexible dynamic scripting language that executes in client browsers. A common paradigm in such websites is to include third-party JavaScript code in the form of libraries or advertisements. If this code were malicious, it could read sensitive information from the page or write ...
Keywords: confidentiality, flow analysis, integrity, set constraints, web applications
Also published in:
May 2009  ACM SIGPLAN Notices - PLDI '09: Volume 44 Issue 6, June 2009
[result highlights]

4 published by ACM
June 2012 PLDI '12: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 22
Downloads (6 Weeks): 3,   Downloads (12 Months): 32,   Downloads (Overall): 270

Full text available: PDFPDF
We present a novel technique for verifying properties of data parallel GPU programs via test amplification . The key insight behind our work is that we can use the technique of static information flow to amplify the result of a single test execution over the set of all inputs and ...
Keywords: determinism, gpu, test amplification
Also published in:
August 2012  ACM SIGPLAN Notices - PLDI '12: Volume 47 Issue 6, June 2012
[result highlights]

5 published by ACM
June 2009 PLDI '09: Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 30
Downloads (6 Weeks): 8,   Downloads (12 Months): 32,   Downloads (Overall): 449

Full text available: PDFPDF
Translation validation is a technique for checking that, after an optimization has run, the input and output of the optimization are equivalent. Traditionally, translation validation has been used to prove concrete, fully specified programs equivalent. In this paper we present Parameterized Equivalence Checking (PEC), a generalization of translation validation that ...
Keywords: compiler optimization, correctness, translation validation
Also published in:
May 2009  ACM SIGPLAN Notices - PLDI '09: Volume 44 Issue 6, June 2009
[result highlights]

6 published by ACM
January 2005 POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher: ACM
Bibliometrics:
Citation Count: 56
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Downloads (Overall): 591

Full text available: PdfPdf
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations using explicit dataflow facts manipulated by local propagation and transformation rules. This new style allows Rhodium optimizations to be mutually recursively defined, to be automatically ...
Keywords: automated correctness proofs, compiler optimization
Also published in:
January 2005  ACM SIGPLAN Notices - Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages: Volume 40 Issue 1, January 2005
[result highlights]

7 published by ACM
May 2003 ACM SIGPLAN Notices: Volume 38 Issue 5, May 2003
Publisher: ACM
Bibliometrics:
Citation Count: 56
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Downloads (Overall): 1,552

Full text available: PDFPDF
We describe a technique for automatically proving compiler optimizations sound , meaning that their transformations are always semantics-preserving. We first present a domain-specific language, called Cobalt, for implementing optimizations as guarded rewrite rules. Cobalt optimizations operate over a C-like intermediate representation including unstructured control flow, pointers to local variables and ...
Keywords: automated correctness proofs, compiler optimization
Also published in:
June 2003  PLDI '03: Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
[result highlights]

Result 1 – 7 of 7


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us