Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29. OOPSLA 2015: Pittsburgh, PA, USA
- Jonathan Aldrich, Patrick Eugster:
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2015, part of SPLASH 2015, Pittsburgh, PA, USA, October 25-30, 2015. ACM 2015, ISBN 978-1-4503-3689-5
Model Checking
- Matthew Hague
, Anthony Widjaja Lin, C.-H. Luke Ong:
Detecting redundant CSS rules in HTML5 applications: a tree rewriting approach. 1-19 - Brian Demsky, Patrick Lam:
SATCheck: SAT-directed stateless model checking for SC and TSO. 20-36 - Ivan Kuraj, Viktor Kuncak, Daniel Jackson:
Programming with enumerable sets of structures. 37-56 - Casper Svenning Jensen, Anders Møller, Veselin Raychev, Dimitar K. Dimitrov, Martin T. Vechev:
Stateless model checking of event-driven applications. 57-73
Domain Specific Languages
- Thibaud Hottelier, Rastislav Bodík:
Synthesis of layout engines from relational constraints. 74-88 - Sebastian Erdweg, Moritz Lichter, Manuel Weiel:
A sound and optimal incremental build system with dynamic dependencies. 89-106 - Oleksandr Polozov, Sumit Gulwani:
FlashMeta: a framework for inductive program synthesis. 107-126 - Haoyuan Zhang, Zewei Chu, Bruno C. d. S. Oliveira, Tijs van der Storm:
Scrap your boilerplate with object algebras. 127-146
Verification
- Rahul Sharma, Eric Schkufza, Berkeley R. Churchill, Alex Aiken:
Conditionally correct superoptimization. 147-162 - Sam Blackshear, Bor-Yuh Evan Chang, Manu Sridharan:
Selective control-flow abstraction via jumping. 163-182 - Ravichandhran Madhavan, Mikaël Mayer, Sumit Gulwani, Viktor Kuncak:
Automating grammar comparison. 183-200 - Gian Ntzik, Philippa Gardner:
Reasoning about the POSIX file system: local update and global pathnames. 201-220
Concurrency
- Peizhao Ou, Brian Demsky:
AutoMO: automatic inference of memory order parameters for C/C++11. 221-240 - Swarnendu Biswas, Minjia Zhang, Michael D. Bond, Brandon Lucia:
Valor: efficient, software-only region conflict exceptions. 241-259 - Nachshon Cohen, Erez Petrank:
Automatic memory reclamation for lock-free data structures. 260-279 - Hugo A. López, Eduardo R. B. Marques, Francisco Martins, Nicholas Ng, César Santos, Vasco Thudichum Vasconcelos, Nobuko Yoshida:
Protocol-based verification of message-passing parallel programs. 280-298
Mobility
- Osbert Bastani, Saswat Anand, Alex Aiken:
Interactively verifying absence of explicit information flows in Android apps. 299-315 - Lucas Brutschy, Pietro Ferrara, Omer Tripp, Marco Pistoia:
ShamDroid: gracefully degrading functionality in the presence of limited resource access. 316-331 - Pavol Bielik, Veselin Raychev, Martin T. Vechev:
Scalable race detection for Android applications. 332-348 - Yongjian Hu, Tanzirul Azim, Iulian Neamtiu:
Versatile yet lightweight record-and-replay for Android. 349-366
Compilation and Tools
- John Bender, Mohsen Lesani, Jens Palsberg:
Declarative fence insertion. 367-385 - Vu Le, Chengnian Sun, Zhendong Su:
Finding deep compiler bugs via guided stochastic program mutation. 386-399 - Haichuan Wang, David A. Padua, Peng Wu:
Vectorization of apply to reduce interpretation overhead of R. 400-415 - Tihomir Gvero, Viktor Kuncak:
Synthesizing Java expressions from free-form queries. 416-432
Runtime
- Yudi Zheng, Lubomír Bulej, Walter Binder:
Accurate profiling in the presence of dynamic compilation. 433-450 - Martin Aigner, Christoph M. Kirsch, Michael Lippautz, Ana Sokolova:
Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structures. 451-469 - Brett Boston, Adrian Sampson, Dan Grossman, Luis Ceze:
Probability type inference for flexible approximate programming. 470-487 - Michael R. Jantz, Forrest J. Robinson, Prasad A. Kulkarni, Kshitij A. Doshi:
Cross-layer memory management for managed language applications. 488-504
Static Analysis
- Magnus Madsen, Frank Tip, Ondrej Lhoták:
Static analysis of event-driven Node.js JavaScript applications. 505-519 - Yu Feng, Xinyu Wang, Isil Dillig, Calvin Lin:
EXPLORER : query- and demand-driven exploration of interprocedural control flow properties. 520-534 - Jens Dietrich, Nicholas Hollingum, Bernhard Scholz:
Giga-scale exhaustive points-to analysis for Java in under a minute. 535-551 - David Darais, Matthew Might, David Van Horn:
Galois transformers and modular abstract interpreters: reusable metatheory for program analysis. 552-571 - Hakjoo Oh, Hongseok Yang, Kwangkeun Yi:
Learning a strategy for adapting a program analysis via bayesian optimisation. 572-588
Compilation and Dynamic Analysis
- Péricles Alves, Fabian Gruber, Johannes Doerfert, Alexandros Lamprineas, Tobias Grosser, Fabrice Rastello, Fernando Magno Quintão Pereira:
Runtime pointer disambiguation. 589-606 - Luca Della Toffola, Michael Pradel, Thomas R. Gross:
Performance problems you can fix: a dynamic analysis of memoization opportunities. 607-622 - Wen-Chuan Lee, Tao Bao, Yunhui Zheng, Xiangyu Zhang, Keval Vora, Rajiv Gupta:
RAIVE: runtime assessment of floating-point instability by vectorization. 623-638 - Zhoulai Fu, Zhaojun Bai, Zhendong Su:
Automated backward error analysis for numerical code. 639-654
Empirical Studies and Approximation
- Markus Voelter, Arie van Deursen, Bernd Kolb, Stephan Eberle:
Using C language extensions for developing embedded software: a case study. 655-674 - Cristina V. Lopes, Joel Ossher:
How scale affects structure in Java programs. 675-694 - Luis Mastrangelo, Luca Ponzanelli, Andrea Mocci, Michele Lanza, Matthias Hauswirth, Nathaniel Nystrom:
Use at your own risk: the Java unsafe API in the wild. 695-710 - Sara Achour, Martin C. Rinard:
Approximate computation with outlier detection in Topaz. 711-730
Programming Language Design
- John Wickerson, Mark Batty, Bradford M. Beckmann, Alastair F. Donaldson:
Remote-scope promotion: clarified, rectified, and verified. 731-747 - Matthew A. Hammer, Jana Dunfield, Kyle Headley, Nicholas Labich, Jeffrey S. Foster, Michael W. Hicks, David Van Horn:
Incremental computation with names. 748-766 - Tim Felgentreff, Todd D. Millstein, Alan Borning, Robert Hirschfeld:
Checks and balances: constraint solving without surprises in object-constraint programming languages. 767-782 - Michael J. Steindorfer, Jurgen J. Vinju:
Optimizing hash-array mapped tries for fast and lean immutable JVM collections. 783-800
Performance
- Vlad Ureche, Aggelos Biboudis, Yannis Smaragdakis, Martin Odersky:
Automating ad hoc data representation transformations. 801-820 - Stefan Marr, Stéphane Ducasse:
Tracing vs. partial evaluation: comparing meta-compilation approaches for self-optimizing interpreters. 821-839 - Ganesha Upadhyaya, Hridesh Rajan:
Effectively mapping linguistic abstractions for message-passing concurrency to threads on the Java virtual machine. 840-859 - Venkatesh Srinivasan, Thomas W. Reps:
Partial evaluation of machine code. 860-879
Type Systems
- Sebastian Erdweg, Oliver Bracevac, Edlira Kuci, Matthias Krebs, Mira Mezini:
A co-contextual formulation of type rules and its application to incremental type checking. 880-897 - Stephan Brandauer, Dave Clarke, Tobias Wrigstad:
Disjointness domains for fine-grained aliasing. 898-916 - Silvia Crafa, Luca Padovani:
The chemical approach to typestate-oriented programming. 917-934 - Matías Toro, Éric Tanter:
Customizable gradual polymorphic effects for Scala. 935-953
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-06-01 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
