- published: 02 Nov 2015
- views: 725
Create your page here
-
remove the playlistOopsla
- remove the playlistOopsla
back to playlist
Talk Title: How Dart Learned From Past Object-Oriented Systems
Presenter: Lars Bak
More Info: http://2015.splashcon.org/event/splash2015-keynotes-lars-bak-keynote
Abstract:The design of the Dart programming language is heavily based on syntax, features, and performance characteristics from past object-oriented systems. This intentional choice has resulted in a productive and yet simple to learn programming language with clear semantics. It can even be implemented efficiently on a wide variety of platforms. We will in this talk discuss several important design decisions, including: constructor semantics, the optional type system, and support for incremental execution and fast application startup. Finally, we will evaluate where the language should be improved.
Alan Kay's seminal 1997 OOPSLA keynote. Originally hosted on Google Video, copies of it are now only available from the squeak.org website as far as I can find. Putting it on youtube is my attempt to preserve a really important talk and computer science and computing in general.
- published: 12 Feb 2013
- views: 29922
Talk Title: Versatile yet Lightweight Record-and-Replay for Android
Presenter: Yongjian Hu
More Info: http://2015.splashcon.org/event/oopsla2015-versatile-yet-lightweight-record-and-replay-for-android
Abstract: Recording and replaying the execution of smartphone apps is useful in a variety of contexts, from reproducing bugs to profiling and testing. Achieving effective record-and-replay is a balancing act between accuracy and overhead. On smartphones, the act is particularly complicated, because smartphone apps receive a high-bandwidth stream of input (e.g., network, GPS, camera, microphone, touchscreen) and concurrency events, but the stream has to be recorded and replayed with minimal overhead, to avoid interfering with app execution. Prior record-and-replay approaches have focused on replaying machine instructions or system calls, which is not a good fit on smartphones. We propose a novel, stream-oriented record-and-replay approach which achieves high-accuracy and low-overhead by aiming at a sweet spot: recording and replaying sensor and network input, event schedules, and inter-app communication via intents. To demonstrate the versatility of our approach, we have constructed a tool named VALERA that supports record-and-replay on the Android platform. VALERA works with apps running directly on the phone, and does not require access to the app source code. Through an evaluation on 50 popular Android apps, we show that: VALERA's replay fidelity far exceeds current record-and-replay approaches for Android; VALERA's precise timing control and low overhead (about 1% for either record or replay) allows it to replay high-throughput, timing-sensitive apps such as video/audio capture and recognition; and VALERA's support for event schedule replay enables the construction of useful analyses, such as reproducing event-driven race bugs.
- published: 02 Nov 2015
- views: 37
A panel at OOPSLA'07 with Frederick Brooks, Martin Fowler, Linda Northrop, David Parnas, and others. (GUESS WHO IS THE WEREWOLF)
- published: 25 Oct 2007
- views: 7363
Talk Title: FlashMeta: A Framework for Inductive Program Synthesis
Presenter: Oleksandr Polozov
More Info: http://2015.splashcon.org/event/oopsla2015-flashmeta-a-framework-for-inductive-program-synthesis
Abstract: Inductive synthesis, or programming-by-examples (PBE) is gaining prominence with disruptive applications for automating repetitive tasks in end-user programming. However, designing, developing, and maintaining an effective industrial-quality inductive synthesizer is an intellectual and engineering challenge, requiring 1-2 man-years of effort.
Our novel observation is that many PBE algorithms are a natural fall-out of one generic meta-algorithm and the domain-specific properties of the operators in the underlying domain-specific language (DSL). The meta-algorithm propagates example-based constraints on an expression to its subexpressions by leveraging associated witness functions, which essentially capture the inverse semantics of the underlying operator. This observation enables a novel program synthesis methodology called data-driven domain-specific deduction (D4), where domain-specific insight, provided by the DSL designer, is separated from the synthesis algorithm.
Our FlashMeta framework implements this methodology, allowing synthesizer developers to generate an efficient synthesizer from the mere DSL definition (if properties of the DSL operators have been modeled). In our case studies, we found that 10+ existing industrial-quality mass-market applications based on PBE can be cast as instances of D4. Our evaluation includes reimplementation of some prior works, which in FlashMeta become more efficient, maintainable, and extensible. As a result, FlashMeta-based PBE tools are deployed in several industrial products, including Microsoft PowerShell 3.0 for Windows 10, Azure Operational Management Suite, and Microsoft Cortana digital assistant.
- published: 02 Nov 2015
- views: 82
Vijay Saraswat accepts the OOPSLA Most Influential Paper Award for the original X10 paper:
X10: an object-oriented approach to non-uniform cluster computing by Philippe Charles, Christopher Donawa, Kemal Ebcioglu, Christian Grothoff, Allan Kielstra, Christoph von Praun, Vijay Saraswat, Vivek Sarkar. OOPSLA 2005.
For more info on X10, see x10-lang.org
- published: 04 Nov 2015
- views: 165
Talk Title: Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
Presenter: Hakjoo Oh
More Info: http://2015.splashcon.org/event/oopsla2015-learning-a-strategy-for-adapting-a-program-analysis-via-bayesian-optimisation
Abstract: Building a cost-effective static analyser for real-world programs is still regarded an art. One key contributor to this grim reputation is the difficulty in balancing the cost and the precision of an analyser. An ideal analyser should be adaptive to a given analysis task, and avoid using techniques that unnecessarily improve precision and increase analysis cost. However, achieving this ideal is highly nontrivial, and it requires a large amount of engineering efforts. In this paper we present a new approach for building an adaptive static analyser. In our approach, the analyser includes a sophisticated parameterised strategy that decides, for each part of a given program, whether to apply a precision-improving technique to that part or not. We present a method for learning a good parameter for such a strategy from an existing codebase via Bayesian optimisation. The learnt strategy is then used for new, unseen programs. Using our approach, we developed partially flow- and context-sensitive variants of a realistic C static analyser. The experimental results demonstrate that using Bayesian optimisation is crucial for learning from an existing codebase. Also, they show that among all program queries that require flow- or context-sensitivity, our partially flow- and context-sensitive analysis answers the 75% of them, while increasing the analysis cost only by 3.3x of the baseline flow- and context-insensitive analysis, rather than 40x or more of the fully sensitive version.
- published: 02 Nov 2015
- views: 150
Talk Title: Synthesis of Layout Engines from Relational Constraints
Presenter: Thibaud Hottelier
More Info: http://2015.splashcon.org/event/oopsla2015-synthesis-of-layout-engines-from-relational-constraints
Abstract: We present an algorithm for synthesizing efficient document layout engines from compact relational specifications. These specifications are compact in that a single specification can produce multiple engines, each for a distinct layout situation, i.e., a different combination of known vs. unknown attributes. Technically, our specifications are relational attribute grammars, while our engines are functional attribute grammars. By synthesizing functions from relational constraints, we obviate the need for constraint solving at runtime, because functional attribute grammars can be easily evaluated according to a fixed schedule, sidestepping the backtracking search performed by constraint solvers. Our experiments show that we can generate layout engines for non-trivial data visualizations, and that our synthesized engines are between 39- and 200-times faster than general-purpose constraint solvers. Relational specifications of layout give rise to synthesis problems that have previously proved intractable. Our algorithm exploits the hierarchical, grammar-based structure of the specification, decomposing the specification into smaller subproblems, which can be tackled with off-the-shelf synthesis procedures. The new synthesis problem then becomes the composition of the functions thus generated into a correct attribute grammar, which might be recursive. We show how to solve this problem by efficient reduction to an SMT problem.
- published: 02 Nov 2015
- views: 59
The following presentation was recorded live in San Jose, California, October of 1996, at The 1996 ACM Conference on Object-Oriented Programs, Systems, Languages and Applications (OOPSLA).
A full transcript of this talk is available here: http://www.patternlanguage.com/archive/ieee/ieeetext.htm
Video transcoded from VHS and provided by The Understanding Group (TUG): http://understandinggroup.com/2011/11/christopher-alexander-from-1996-patterns-in-architecture/
- published: 09 Sep 2013
- views: 20036
Alan Curtis Kay (born May 17, 1940) is an American computer scientist, known for his early pioneering work on object-oriented programming and windowing graphical user interface design, and for coining the phrase, "The best way to predict the future is to invent it."
He is the president of the Viewpoints Research Institute, and an Adjunct Professor of Computer Science at the University of California, Los Angeles. He is also on the advisory board of TTI/Vanguard. Until mid 2005, he was a Senior Fellow at HP Labs, a Visiting Professor at Kyoto University, and an Adjunct Professor at the Massachusetts Institute of Technology (MIT).
Alan Kay showed remarkable ability at an early age, learning to read fluently at three years old. In an interview on education in America with the Davis Group Ltd. Alan Kay said, "I had the fortune or misfortune to learn how to read fluently starting at the age of three. So I had read maybe 150 books by the time I hit 1st grade. And I already knew that the teachers were lying to me."
This page contains text from Wikipedia, the Free Encyclopedia -
http://en.wikipedia.org/wiki/Alan_Kay
This article is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License, which means that you can copy and modify it as long as the entire work (including additions) remains under this license.
This article is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License, which means that you can copy and modify it as long as the entire work (including additions) remains under this license.
- Loading...
-
61:23[OOPSLA Keynote] How Dart Learned From Past Object-Oriented Systems
[OOPSLA Keynote] How Dart Learned From Past Object-Oriented Systems[OOPSLA Keynote] How Dart Learned From Past Object-Oriented Systems
Talk Title: How Dart Learned From Past Object-Oriented Systems Presenter: Lars Bak More Info: http://2015.splashcon.org/event/splash2015-keynotes-lars-bak-keynote Abstract:The design of the Dart programming language is heavily based on syntax, features, and performance characteristics from past object-oriented systems. This intentional choice has resulted in a productive and yet simple to learn programming language with clear semantics. It can even be implemented efficiently on a wide variety of platforms. We will in this talk discuss several important design decisions, including: constructor semantics, the optional type system, and support for incremental execution and fast application startup. Finally, we will evaluate where the language should be improved. -
64:34Alan Kay at OOPSLA 1997 - The computer revolution hasnt happened yet
Alan Kay at OOPSLA 1997 - The computer revolution hasnt happened yetAlan Kay at OOPSLA 1997 - The computer revolution hasnt happened yet
Alan Kay's seminal 1997 OOPSLA keynote. Originally hosted on Google Video, copies of it are now only available from the squeak.org website as far as I can find. Putting it on youtube is my attempt to preserve a really important talk and computer science and computing in general. -
6:37OOPSLA 2001
OOPSLA 2001 -
19:36[OOPSLA] Versatile yet Lightweight Record-and-Replay for Android
[OOPSLA] Versatile yet Lightweight Record-and-Replay for Android[OOPSLA] Versatile yet Lightweight Record-and-Replay for Android
Talk Title: Versatile yet Lightweight Record-and-Replay for Android Presenter: Yongjian Hu More Info: http://2015.splashcon.org/event/oopsla2015-versatile-yet-lightweight-record-and-replay-for-android Abstract: Recording and replaying the execution of smartphone apps is useful in a variety of contexts, from reproducing bugs to profiling and testing. Achieving effective record-and-replay is a balancing act between accuracy and overhead. On smartphones, the act is particularly complicated, because smartphone apps receive a high-bandwidth stream of input (e.g., network, GPS, camera, microphone, touchscreen) and concurrency events, but the stream has to be recorded and replayed with minimal overhead, to avoid interfering with app execution. Prior record-and-replay approaches have focused on replaying machine instructions or system calls, which is not a good fit on smartphones. We propose a novel, stream-oriented record-and-replay approach which achieves high-accuracy and low-overhead by aiming at a sweet spot: recording and replaying sensor and network input, event schedules, and inter-app communication via intents. To demonstrate the versatility of our approach, we have constructed a tool named VALERA that supports record-and-replay on the Android platform. VALERA works with apps running directly on the phone, and does not require access to the app source code. Through an evaluation on 50 popular Android apps, we show that: VALERA's replay fidelity far exceeds current record-and-replay approaches for Android; VALERA's precise timing control and low overhead (about 1% for either record or replay) allows it to replay high-throughput, timing-sensitive apps such as video/audio capture and recognition; and VALERA's support for event schedule replay enables the construction of useful analyses, such as reproducing event-driven race bugs. -
1:32OOPSLA 2007 Band
OOPSLA 2007 Band -
2:06OOPSLA 2007 Painel (There is no silver bullet)
OOPSLA 2007 Painel (There is no silver bullet)OOPSLA 2007 Painel (There is no silver bullet)
A panel at OOPSLA'07 with Frederick Brooks, Martin Fowler, Linda Northrop, David Parnas, and others. (GUESS WHO IS THE WEREWOLF) -
16:59[OOPSLA] FlashMeta: A Framework for Inductive Program Synthesis
[OOPSLA] FlashMeta: A Framework for Inductive Program Synthesis[OOPSLA] FlashMeta: A Framework for Inductive Program Synthesis
Talk Title: FlashMeta: A Framework for Inductive Program Synthesis Presenter: Oleksandr Polozov More Info: http://2015.splashcon.org/event/oopsla2015-flashmeta-a-framework-for-inductive-program-synthesis Abstract: Inductive synthesis, or programming-by-examples (PBE) is gaining prominence with disruptive applications for automating repetitive tasks in end-user programming. However, designing, developing, and maintaining an effective industrial-quality inductive synthesizer is an intellectual and engineering challenge, requiring 1-2 man-years of effort. Our novel observation is that many PBE algorithms are a natural fall-out of one generic meta-algorithm and the domain-specific properties of the operators in the underlying domain-specific language (DSL). The meta-algorithm propagates example-based constraints on an expression to its subexpressions by leveraging associated witness functions, which essentially capture the inverse semantics of the underlying operator. This observation enables a novel program synthesis methodology called data-driven domain-specific deduction (D4), where domain-specific insight, provided by the DSL designer, is separated from the synthesis algorithm. Our FlashMeta framework implements this methodology, allowing synthesizer developers to generate an efficient synthesizer from the mere DSL definition (if properties of the DSL operators have been modeled). In our case studies, we found that 10+ existing industrial-quality mass-market applications based on PBE can be cast as instances of D4. Our evaluation includes reimplementation of some prior works, which in FlashMeta become more efficient, maintainable, and extensible. As a result, FlashMeta-based PBE tools are deployed in several industrial products, including Microsoft PowerShell 3.0 for Windows 10, Azure Operational Management Suite, and Microsoft Cortana digital assistant. -
6:56X10 wins 2005 ACM SIGPLAN OOPSLA Most Influential Paper Award
X10 wins 2005 ACM SIGPLAN OOPSLA Most Influential Paper AwardX10 wins 2005 ACM SIGPLAN OOPSLA Most Influential Paper Award
Vijay Saraswat accepts the OOPSLA Most Influential Paper Award for the original X10 paper: X10: an object-oriented approach to non-uniform cluster computing by Philippe Charles, Christopher Donawa, Kemal Ebcioglu, Christian Grothoff, Allan Kielstra, Christoph von Praun, Vijay Saraswat, Vivek Sarkar. OOPSLA 2005. For more info on X10, see x10-lang.org -
24:22[OOPSLA] Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
[OOPSLA] Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation[OOPSLA] Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
Talk Title: Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation Presenter: Hakjoo Oh More Info: http://2015.splashcon.org/event/oopsla2015-learning-a-strategy-for-adapting-a-program-analysis-via-bayesian-optimisation Abstract: Building a cost-effective static analyser for real-world programs is still regarded an art. One key contributor to this grim reputation is the difficulty in balancing the cost and the precision of an analyser. An ideal analyser should be adaptive to a given analysis task, and avoid using techniques that unnecessarily improve precision and increase analysis cost. However, achieving this ideal is highly nontrivial, and it requires a large amount of engineering efforts. In this paper we present a new approach for building an adaptive static analyser. In our approach, the analyser includes a sophisticated parameterised strategy that decides, for each part of a given program, whether to apply a precision-improving technique to that part or not. We present a method for learning a good parameter for such a strategy from an existing codebase via Bayesian optimisation. The learnt strategy is then used for new, unseen programs. Using our approach, we developed partially flow- and context-sensitive variants of a realistic C static analyser. The experimental results demonstrate that using Bayesian optimisation is crucial for learning from an existing codebase. Also, they show that among all program queries that require flow- or context-sensitivity, our partially flow- and context-sensitive analysis answers the 75% of them, while increasing the analysis cost only by 3.3x of the baseline flow- and context-insensitive analysis, rather than 40x or more of the fully sensitive version. -
20:06[OOPSLA] Synthesis of Layout Engines from Relational Constraints
[OOPSLA] Synthesis of Layout Engines from Relational Constraints[OOPSLA] Synthesis of Layout Engines from Relational Constraints
Talk Title: Synthesis of Layout Engines from Relational Constraints Presenter: Thibaud Hottelier More Info: http://2015.splashcon.org/event/oopsla2015-synthesis-of-layout-engines-from-relational-constraints Abstract: We present an algorithm for synthesizing efficient document layout engines from compact relational specifications. These specifications are compact in that a single specification can produce multiple engines, each for a distinct layout situation, i.e., a different combination of known vs. unknown attributes. Technically, our specifications are relational attribute grammars, while our engines are functional attribute grammars. By synthesizing functions from relational constraints, we obviate the need for constraint solving at runtime, because functional attribute grammars can be easily evaluated according to a fixed schedule, sidestepping the backtracking search performed by constraint solvers. Our experiments show that we can generate layout engines for non-trivial data visualizations, and that our synthesized engines are between 39- and 200-times faster than general-purpose constraint solvers. Relational specifications of layout give rise to synthesis problems that have previously proved intractable. Our algorithm exploits the hierarchical, grammar-based structure of the specification, decomposing the specification into smaller subproblems, which can be tackled with off-the-shelf synthesis procedures. The new synthesis problem then becomes the composition of the functions thus generated into a correct attribute grammar, which might be recursive. We show how to solve this problem by efficient reduction to an SMT problem. -
0:31Understanding Energy Behaviors of Concurrent Programs -- OOPSLA'14
Understanding Energy Behaviors of Concurrent Programs -- OOPSLA'14Understanding Energy Behaviors of Concurrent Programs -- OOPSLA'14
Ads for our talk at OOPSLA'14 -
63:36Christopher Alexander - Patterns in Architecture
Christopher Alexander - Patterns in ArchitectureChristopher Alexander - Patterns in Architecture
The following presentation was recorded live in San Jose, California, October of 1996, at The 1996 ACM Conference on Object-Oriented Programs, Systems, Languages and Applications (OOPSLA). A full transcript of this talk is available here: http://www.patternlanguage.com/archive/ieee/ieeetext.htm Video transcoded from VHS and provided by The Understanding Group (TUG): http://understandinggroup.com/2011/11/christopher-alexander-from-1996-patterns-in-architecture/
- Alan Kay
- Alan Perlis
- Allen Newell
- Alma mater
- Amir Pnueli
- Andrew Yao
- Apple Inc.
- Apple Lisa
- Applied Minds
- Atari
- Bachelor's degree
- Barbara Liskov
- Berlin
- Bob Kahn
- Bonnie MacBird
- Butler Lampson
- Butler W. Lampson
- Charles Bachman
- Charles P. Thacker
- Computer programming
- Computer science
- Computer scientist
- Croquet Project
- Dana Scott
- David P. Reed
- Dennis Ritchie
- Disney Fellow
- Donald Knuth
- Douglas Engelbart
- Dynabook
- E-book
- E. Allen Emerson
- Edgar F. Codd
- Edmund M. Clarke
- Edsger W. Dijkstra
- Education
- Edward Feigenbaum
- Fernando J. Corbató
- Frances E. Allen
- Fred Brooks
- Germany
- GUI
- Herbert A. Simon
- Hewlett-Packard
- HP Labs
- Ivan Sutherland
- James H. Wilkinson
- Jazz
- Jean Piaget
- Jerome Bruner
- John Backus
- John Cocke
- John Hopcroft
- Joseph Sifakis
- Judea Pearl
- Julian Lombardi
- Juris Hartmanis
- Ken Thompson
- Kenneth E. Iverson
- Kristen Nygaard
- KTH
- Kyoto Prize
- Kyoto University
- Laptop
- Leonard Adleman
- Leslie Valiant
- Lev Vygotsky
- Macintosh
- Manuel Blum
- Mark McCahill
- Marvin Minsky
- Maurice Wilkes
- Michael O. Rabin
- Mobile learning
- Nicholas Negroponte
- Niklaus Wirth
- Ole-Johan Dahl
- One Laptop Per Child
- One Laptop per Child
- Open source
- PARC (company)
- Peter Naur
- Programming language
- Raj Reddy
- Richard Hamming
- Richard Karp
- Robert Tarjan
- Robert W. Floyd
- Robin Milner
- Ron Rivest
- Seymour Papert
- Simula
- Sketchpad
- Smalltalk
- Squeak
- Stanford University
- Stephen Cook
- Tablet computer
- TED (conference)
- Tony Hoare
- TTI Vanguard
- Turing Award
- United States
- University of Utah
- Università di Pisa
- Vint Cerf
- Wikipedia Persondata
- William Kahan
- Window (computing)
- Xerox
- XO-1 (laptop)
- Adi Shamir
- Alan Kay
- Alan Perlis
- Allen Newell
- Amir Pnueli
- Andrew Yao
- Bob Kahn
- Bonnie MacBird
- Butler Lampson
- Charles Bachman
- Dana Scott
- Dennis Ritchie
- Donald Knuth
- Douglas Engelbart
- Edward Feigenbaum
- Fred Brooks
- Ivan Sutherland
- Jean Piaget
- Jerome Bruner
- John Backus
- John Cocke
- John Hopcroft
- Joseph Sifakis
- Judea Pearl
- Julian Lombardi
- Juris Hartmanis
- Ken Thompson
- Kristen Nygaard
- Leonard Adleman
- Leslie Valiant
- Lev Vygotsky
- Manuel Blum
- Marvin Minsky
- Maurice Wilkes
- Nicholas Negroponte
- Niklaus Wirth
- Peter Naur
- Raj Reddy
- Richard Hamming
- Robert Tarjan
- Robin Milner
- Ron Rivest
- Seymour Papert
- Stephen Cook
- Tony Hoare
- Vint Cerf
- Wikipedia Persondata
- William Kahan
-
[OOPSLA Keynote] How Dart Learned From Past Object-Oriented Systems
Talk Title: How Dart Learned From Past Object-Oriented Systems Presenter: Lars Bak More Info: http://2015.splashcon.org/event/splash2015-keynotes-lars-bak-keynote Abstract:The design of the Dart programming language is heavily based on syntax, features, and performance characteristics from past object-oriented systems. This intentional choice has resulted in a productive and yet simple to learn programming language with clear semantics. It can even be implemented efficiently on a wide variety of platforms. We will in this talk discuss several important design decisions, including: constructor semantics, the optional type system, and support for incremental execution and fast application startup. Finally, we will evaluate where the language should be improved. -
Alan Kay at OOPSLA 1997 - The computer revolution hasnt happened yet
Alan Kay's seminal 1997 OOPSLA keynote. Originally hosted on Google Video, copies of it are now only available from the squeak.org website as far as I can find. Putting it on youtube is my attempt to preserve a really important talk and computer science and computing in general. -
-
[OOPSLA] Versatile yet Lightweight Record-and-Replay for Android
Talk Title: Versatile yet Lightweight Record-and-Replay for Android Presenter: Yongjian Hu More Info: http://2015.splashcon.org/event/oopsla2015-versatile-yet-lightweight-record-and-replay-for-android Abstract: Recording and replaying the execution of smartphone apps is useful in a variety of contexts, from reproducing bugs to profiling and testing. Achieving effective record-and-replay is a balancing act between accuracy and overhead. On smartphones, the act is particularly complicated, because smartphone apps receive a high-bandwidth stream of input (e.g., network, GPS, camera, microphone, touchscreen) and concurrency events, but the stream has to be recorded and replayed with minimal overhead, to avoid interfering with app execution. Prior record-and-replay approaches have focused on r... -
-
OOPSLA 2007 Painel (There is no silver bullet)
A panel at OOPSLA'07 with Frederick Brooks, Martin Fowler, Linda Northrop, David Parnas, and others. (GUESS WHO IS THE WEREWOLF) -
[OOPSLA] FlashMeta: A Framework for Inductive Program Synthesis
Talk Title: FlashMeta: A Framework for Inductive Program Synthesis Presenter: Oleksandr Polozov More Info: http://2015.splashcon.org/event/oopsla2015-flashmeta-a-framework-for-inductive-program-synthesis Abstract: Inductive synthesis, or programming-by-examples (PBE) is gaining prominence with disruptive applications for automating repetitive tasks in end-user programming. However, designing, developing, and maintaining an effective industrial-quality inductive synthesizer is an intellectual and engineering challenge, requiring 1-2 man-years of effort. Our novel observation is that many PBE algorithms are a natural fall-out of one generic meta-algorithm and the domain-specific properties of the operators in the underlying domain-specific language (DSL). The meta-algorithm propagates exam... -
X10 wins 2005 ACM SIGPLAN OOPSLA Most Influential Paper Award
Vijay Saraswat accepts the OOPSLA Most Influential Paper Award for the original X10 paper: X10: an object-oriented approach to non-uniform cluster computing by Philippe Charles, Christopher Donawa, Kemal Ebcioglu, Christian Grothoff, Allan Kielstra, Christoph von Praun, Vijay Saraswat, Vivek Sarkar. OOPSLA 2005. For more info on X10, see x10-lang.org -
[OOPSLA] Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
Talk Title: Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation Presenter: Hakjoo Oh More Info: http://2015.splashcon.org/event/oopsla2015-learning-a-strategy-for-adapting-a-program-analysis-via-bayesian-optimisation Abstract: Building a cost-effective static analyser for real-world programs is still regarded an art. One key contributor to this grim reputation is the difficulty in balancing the cost and the precision of an analyser. An ideal analyser should be adaptive to a given analysis task, and avoid using techniques that unnecessarily improve precision and increase analysis cost. However, achieving this ideal is highly nontrivial, and it requires a large amount of engineering efforts. In this paper we present a new approach for building an adaptive static an... -
[OOPSLA] Synthesis of Layout Engines from Relational Constraints
Talk Title: Synthesis of Layout Engines from Relational Constraints Presenter: Thibaud Hottelier More Info: http://2015.splashcon.org/event/oopsla2015-synthesis-of-layout-engines-from-relational-constraints Abstract: We present an algorithm for synthesizing efficient document layout engines from compact relational specifications. These specifications are compact in that a single specification can produce multiple engines, each for a distinct layout situation, i.e., a different combination of known vs. unknown attributes. Technically, our specifications are relational attribute grammars, while our engines are functional attribute grammars. By synthesizing functions from relational constraints, we obviate the need for constraint solving at runtime, because functional attribute grammars can ... -
Understanding Energy Behaviors of Concurrent Programs -- OOPSLA'14
Ads for our talk at OOPSLA'14 -
Christopher Alexander - Patterns in Architecture
The following presentation was recorded live in San Jose, California, October of 1996, at The 1996 ACM Conference on Object-Oriented Programs, Systems, Languages and Applications (OOPSLA). A full transcript of this talk is available here: http://www.patternlanguage.com/archive/ieee/ieeetext.htm Video transcoded from VHS and provided by The Understanding Group (TUG): http://understandinggroup.com/2011/11/christopher-alexander-from-1996-patterns-in-architecture/
[OOPSLA Keynote] How Dart Learned From Past Object-Oriented Systems
- Order: Reorder
- Duration: 61:23
- Updated: 02 Nov 2015
- views: 725
Talk Title: How Dart Learned From Past Object-Oriented Systems
Presenter: Lars Bak
More Info: http://2015.splashcon.org/event/splash2015-keynotes-lars-bak-keyno...
Talk Title: How Dart Learned From Past Object-Oriented Systems
Presenter: Lars Bak
More Info: http://2015.splashcon.org/event/splash2015-keynotes-lars-bak-keynote
Abstract:The design of the Dart programming language is heavily based on syntax, features, and performance characteristics from past object-oriented systems. This intentional choice has resulted in a productive and yet simple to learn programming language with clear semantics. It can even be implemented efficiently on a wide variety of platforms. We will in this talk discuss several important design decisions, including: constructor semantics, the optional type system, and support for incremental execution and fast application startup. Finally, we will evaluate where the language should be improved.
wn.com/Oopsla Keynote How Dart Learned From Past Object Oriented Systems
Talk Title: How Dart Learned From Past Object-Oriented Systems
Presenter: Lars Bak
More Info: http://2015.splashcon.org/event/splash2015-keynotes-lars-bak-keynote
Abstract:The design of the Dart programming language is heavily based on syntax, features, and performance characteristics from past object-oriented systems. This intentional choice has resulted in a productive and yet simple to learn programming language with clear semantics. It can even be implemented efficiently on a wide variety of platforms. We will in this talk discuss several important design decisions, including: constructor semantics, the optional type system, and support for incremental execution and fast application startup. Finally, we will evaluate where the language should be improved.
- published: 02 Nov 2015
- views: 725
Alan Kay at OOPSLA 1997 - The computer revolution hasnt happened yet
- Order: Reorder
- Duration: 64:34
- Updated: 12 Feb 2013
- views: 29922
Alan Kay's seminal 1997 OOPSLA keynote. Originally hosted on Google Video, copies of it are now only available from the squeak.org website as far as I can find...
Alan Kay's seminal 1997 OOPSLA keynote. Originally hosted on Google Video, copies of it are now only available from the squeak.org website as far as I can find. Putting it on youtube is my attempt to preserve a really important talk and computer science and computing in general.
wn.com/Alan Kay At Oopsla 1997 The Computer Revolution Hasnt Happened Yet
Alan Kay's seminal 1997 OOPSLA keynote. Originally hosted on Google Video, copies of it are now only available from the squeak.org website as far as I can find. Putting it on youtube is my attempt to preserve a really important talk and computer science and computing in general.
- published: 12 Feb 2013
- views: 29922
[OOPSLA] Versatile yet Lightweight Record-and-Replay for Android
- Order: Reorder
- Duration: 19:36
- Updated: 02 Nov 2015
- views: 37
Talk Title: Versatile yet Lightweight Record-and-Replay for Android
Presenter: Yongjian Hu
More Info: http://2015.splashcon.org/event/oopsla2015-versatile-yet-l...
Talk Title: Versatile yet Lightweight Record-and-Replay for Android
Presenter: Yongjian Hu
More Info: http://2015.splashcon.org/event/oopsla2015-versatile-yet-lightweight-record-and-replay-for-android
Abstract: Recording and replaying the execution of smartphone apps is useful in a variety of contexts, from reproducing bugs to profiling and testing. Achieving effective record-and-replay is a balancing act between accuracy and overhead. On smartphones, the act is particularly complicated, because smartphone apps receive a high-bandwidth stream of input (e.g., network, GPS, camera, microphone, touchscreen) and concurrency events, but the stream has to be recorded and replayed with minimal overhead, to avoid interfering with app execution. Prior record-and-replay approaches have focused on replaying machine instructions or system calls, which is not a good fit on smartphones. We propose a novel, stream-oriented record-and-replay approach which achieves high-accuracy and low-overhead by aiming at a sweet spot: recording and replaying sensor and network input, event schedules, and inter-app communication via intents. To demonstrate the versatility of our approach, we have constructed a tool named VALERA that supports record-and-replay on the Android platform. VALERA works with apps running directly on the phone, and does not require access to the app source code. Through an evaluation on 50 popular Android apps, we show that: VALERA's replay fidelity far exceeds current record-and-replay approaches for Android; VALERA's precise timing control and low overhead (about 1% for either record or replay) allows it to replay high-throughput, timing-sensitive apps such as video/audio capture and recognition; and VALERA's support for event schedule replay enables the construction of useful analyses, such as reproducing event-driven race bugs.
wn.com/Oopsla Versatile Yet Lightweight Record And Replay For Android
Talk Title: Versatile yet Lightweight Record-and-Replay for Android
Presenter: Yongjian Hu
More Info: http://2015.splashcon.org/event/oopsla2015-versatile-yet-lightweight-record-and-replay-for-android
Abstract: Recording and replaying the execution of smartphone apps is useful in a variety of contexts, from reproducing bugs to profiling and testing. Achieving effective record-and-replay is a balancing act between accuracy and overhead. On smartphones, the act is particularly complicated, because smartphone apps receive a high-bandwidth stream of input (e.g., network, GPS, camera, microphone, touchscreen) and concurrency events, but the stream has to be recorded and replayed with minimal overhead, to avoid interfering with app execution. Prior record-and-replay approaches have focused on replaying machine instructions or system calls, which is not a good fit on smartphones. We propose a novel, stream-oriented record-and-replay approach which achieves high-accuracy and low-overhead by aiming at a sweet spot: recording and replaying sensor and network input, event schedules, and inter-app communication via intents. To demonstrate the versatility of our approach, we have constructed a tool named VALERA that supports record-and-replay on the Android platform. VALERA works with apps running directly on the phone, and does not require access to the app source code. Through an evaluation on 50 popular Android apps, we show that: VALERA's replay fidelity far exceeds current record-and-replay approaches for Android; VALERA's precise timing control and low overhead (about 1% for either record or replay) allows it to replay high-throughput, timing-sensitive apps such as video/audio capture and recognition; and VALERA's support for event schedule replay enables the construction of useful analyses, such as reproducing event-driven race bugs.
- published: 02 Nov 2015
- views: 37
OOPSLA 2007 Band
- Order: Reorder
- Duration: 1:32
- Updated: 25 Oct 2007
- views: 580
OOPSLA participants (and the General Chair) gives a taste about how making accidental live music without any previous preparation
OOPSLA participants (and the General Chair) gives a taste about how making accidental live music without any previous preparation
wn.com/Oopsla 2007 Band
OOPSLA 2007 Painel (There is no silver bullet)
- Order: Reorder
- Duration: 2:06
- Updated: 25 Oct 2007
- views: 7363
A panel at OOPSLA'07 with Frederick Brooks, Martin Fowler, Linda Northrop, David Parnas, and others. (GUESS WHO IS THE WEREWOLF)
A panel at OOPSLA'07 with Frederick Brooks, Martin Fowler, Linda Northrop, David Parnas, and others. (GUESS WHO IS THE WEREWOLF)
wn.com/Oopsla 2007 Painel (There Is No Silver Bullet)
A panel at OOPSLA'07 with Frederick Brooks, Martin Fowler, Linda Northrop, David Parnas, and others. (GUESS WHO IS THE WEREWOLF)
- published: 25 Oct 2007
- views: 7363
[OOPSLA] FlashMeta: A Framework for Inductive Program Synthesis
- Order: Reorder
- Duration: 16:59
- Updated: 02 Nov 2015
- views: 82
Talk Title: FlashMeta: A Framework for Inductive Program Synthesis
Presenter: Oleksandr Polozov
More Info: http://2015.splashcon.org/event/oopsla2015-flashmeta-...
Talk Title: FlashMeta: A Framework for Inductive Program Synthesis
Presenter: Oleksandr Polozov
More Info: http://2015.splashcon.org/event/oopsla2015-flashmeta-a-framework-for-inductive-program-synthesis
Abstract: Inductive synthesis, or programming-by-examples (PBE) is gaining prominence with disruptive applications for automating repetitive tasks in end-user programming. However, designing, developing, and maintaining an effective industrial-quality inductive synthesizer is an intellectual and engineering challenge, requiring 1-2 man-years of effort.
Our novel observation is that many PBE algorithms are a natural fall-out of one generic meta-algorithm and the domain-specific properties of the operators in the underlying domain-specific language (DSL). The meta-algorithm propagates example-based constraints on an expression to its subexpressions by leveraging associated witness functions, which essentially capture the inverse semantics of the underlying operator. This observation enables a novel program synthesis methodology called data-driven domain-specific deduction (D4), where domain-specific insight, provided by the DSL designer, is separated from the synthesis algorithm.
Our FlashMeta framework implements this methodology, allowing synthesizer developers to generate an efficient synthesizer from the mere DSL definition (if properties of the DSL operators have been modeled). In our case studies, we found that 10+ existing industrial-quality mass-market applications based on PBE can be cast as instances of D4. Our evaluation includes reimplementation of some prior works, which in FlashMeta become more efficient, maintainable, and extensible. As a result, FlashMeta-based PBE tools are deployed in several industrial products, including Microsoft PowerShell 3.0 for Windows 10, Azure Operational Management Suite, and Microsoft Cortana digital assistant.
wn.com/Oopsla Flashmeta A Framework For Inductive Program Synthesis
Talk Title: FlashMeta: A Framework for Inductive Program Synthesis
Presenter: Oleksandr Polozov
More Info: http://2015.splashcon.org/event/oopsla2015-flashmeta-a-framework-for-inductive-program-synthesis
Abstract: Inductive synthesis, or programming-by-examples (PBE) is gaining prominence with disruptive applications for automating repetitive tasks in end-user programming. However, designing, developing, and maintaining an effective industrial-quality inductive synthesizer is an intellectual and engineering challenge, requiring 1-2 man-years of effort.
Our novel observation is that many PBE algorithms are a natural fall-out of one generic meta-algorithm and the domain-specific properties of the operators in the underlying domain-specific language (DSL). The meta-algorithm propagates example-based constraints on an expression to its subexpressions by leveraging associated witness functions, which essentially capture the inverse semantics of the underlying operator. This observation enables a novel program synthesis methodology called data-driven domain-specific deduction (D4), where domain-specific insight, provided by the DSL designer, is separated from the synthesis algorithm.
Our FlashMeta framework implements this methodology, allowing synthesizer developers to generate an efficient synthesizer from the mere DSL definition (if properties of the DSL operators have been modeled). In our case studies, we found that 10+ existing industrial-quality mass-market applications based on PBE can be cast as instances of D4. Our evaluation includes reimplementation of some prior works, which in FlashMeta become more efficient, maintainable, and extensible. As a result, FlashMeta-based PBE tools are deployed in several industrial products, including Microsoft PowerShell 3.0 for Windows 10, Azure Operational Management Suite, and Microsoft Cortana digital assistant.
- published: 02 Nov 2015
- views: 82
X10 wins 2005 ACM SIGPLAN OOPSLA Most Influential Paper Award
- Order: Reorder
- Duration: 6:56
- Updated: 04 Nov 2015
- views: 165
Vijay Saraswat accepts the OOPSLA Most Influential Paper Award for the original X10 paper:
X10: an object-oriented approach to non-uniform cluster computing by ...
Vijay Saraswat accepts the OOPSLA Most Influential Paper Award for the original X10 paper:
X10: an object-oriented approach to non-uniform cluster computing by Philippe Charles, Christopher Donawa, Kemal Ebcioglu, Christian Grothoff, Allan Kielstra, Christoph von Praun, Vijay Saraswat, Vivek Sarkar. OOPSLA 2005.
For more info on X10, see x10-lang.org
wn.com/X10 Wins 2005 Acm Sigplan Oopsla Most Influential Paper Award
Vijay Saraswat accepts the OOPSLA Most Influential Paper Award for the original X10 paper:
X10: an object-oriented approach to non-uniform cluster computing by Philippe Charles, Christopher Donawa, Kemal Ebcioglu, Christian Grothoff, Allan Kielstra, Christoph von Praun, Vijay Saraswat, Vivek Sarkar. OOPSLA 2005.
For more info on X10, see x10-lang.org
- published: 04 Nov 2015
- views: 165
[OOPSLA] Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
- Order: Reorder
- Duration: 24:22
- Updated: 02 Nov 2015
- views: 150
Talk Title: Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
Presenter: Hakjoo Oh
More Info: http://2015.splashcon.org/event/oopsla...
Talk Title: Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
Presenter: Hakjoo Oh
More Info: http://2015.splashcon.org/event/oopsla2015-learning-a-strategy-for-adapting-a-program-analysis-via-bayesian-optimisation
Abstract: Building a cost-effective static analyser for real-world programs is still regarded an art. One key contributor to this grim reputation is the difficulty in balancing the cost and the precision of an analyser. An ideal analyser should be adaptive to a given analysis task, and avoid using techniques that unnecessarily improve precision and increase analysis cost. However, achieving this ideal is highly nontrivial, and it requires a large amount of engineering efforts. In this paper we present a new approach for building an adaptive static analyser. In our approach, the analyser includes a sophisticated parameterised strategy that decides, for each part of a given program, whether to apply a precision-improving technique to that part or not. We present a method for learning a good parameter for such a strategy from an existing codebase via Bayesian optimisation. The learnt strategy is then used for new, unseen programs. Using our approach, we developed partially flow- and context-sensitive variants of a realistic C static analyser. The experimental results demonstrate that using Bayesian optimisation is crucial for learning from an existing codebase. Also, they show that among all program queries that require flow- or context-sensitivity, our partially flow- and context-sensitive analysis answers the 75% of them, while increasing the analysis cost only by 3.3x of the baseline flow- and context-insensitive analysis, rather than 40x or more of the fully sensitive version.
wn.com/Oopsla Learning A Strategy For Adapting A Program Analysis Via Bayesian Optimisation
Talk Title: Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
Presenter: Hakjoo Oh
More Info: http://2015.splashcon.org/event/oopsla2015-learning-a-strategy-for-adapting-a-program-analysis-via-bayesian-optimisation
Abstract: Building a cost-effective static analyser for real-world programs is still regarded an art. One key contributor to this grim reputation is the difficulty in balancing the cost and the precision of an analyser. An ideal analyser should be adaptive to a given analysis task, and avoid using techniques that unnecessarily improve precision and increase analysis cost. However, achieving this ideal is highly nontrivial, and it requires a large amount of engineering efforts. In this paper we present a new approach for building an adaptive static analyser. In our approach, the analyser includes a sophisticated parameterised strategy that decides, for each part of a given program, whether to apply a precision-improving technique to that part or not. We present a method for learning a good parameter for such a strategy from an existing codebase via Bayesian optimisation. The learnt strategy is then used for new, unseen programs. Using our approach, we developed partially flow- and context-sensitive variants of a realistic C static analyser. The experimental results demonstrate that using Bayesian optimisation is crucial for learning from an existing codebase. Also, they show that among all program queries that require flow- or context-sensitivity, our partially flow- and context-sensitive analysis answers the 75% of them, while increasing the analysis cost only by 3.3x of the baseline flow- and context-insensitive analysis, rather than 40x or more of the fully sensitive version.
- published: 02 Nov 2015
- views: 150
[OOPSLA] Synthesis of Layout Engines from Relational Constraints
- Order: Reorder
- Duration: 20:06
- Updated: 02 Nov 2015
- views: 59
Talk Title: Synthesis of Layout Engines from Relational Constraints
Presenter: Thibaud Hottelier
More Info: http://2015.splashcon.org/event/oopsla2015-synthesis...
Talk Title: Synthesis of Layout Engines from Relational Constraints
Presenter: Thibaud Hottelier
More Info: http://2015.splashcon.org/event/oopsla2015-synthesis-of-layout-engines-from-relational-constraints
Abstract: We present an algorithm for synthesizing efficient document layout engines from compact relational specifications. These specifications are compact in that a single specification can produce multiple engines, each for a distinct layout situation, i.e., a different combination of known vs. unknown attributes. Technically, our specifications are relational attribute grammars, while our engines are functional attribute grammars. By synthesizing functions from relational constraints, we obviate the need for constraint solving at runtime, because functional attribute grammars can be easily evaluated according to a fixed schedule, sidestepping the backtracking search performed by constraint solvers. Our experiments show that we can generate layout engines for non-trivial data visualizations, and that our synthesized engines are between 39- and 200-times faster than general-purpose constraint solvers. Relational specifications of layout give rise to synthesis problems that have previously proved intractable. Our algorithm exploits the hierarchical, grammar-based structure of the specification, decomposing the specification into smaller subproblems, which can be tackled with off-the-shelf synthesis procedures. The new synthesis problem then becomes the composition of the functions thus generated into a correct attribute grammar, which might be recursive. We show how to solve this problem by efficient reduction to an SMT problem.
wn.com/Oopsla Synthesis Of Layout Engines From Relational Constraints
Talk Title: Synthesis of Layout Engines from Relational Constraints
Presenter: Thibaud Hottelier
More Info: http://2015.splashcon.org/event/oopsla2015-synthesis-of-layout-engines-from-relational-constraints
Abstract: We present an algorithm for synthesizing efficient document layout engines from compact relational specifications. These specifications are compact in that a single specification can produce multiple engines, each for a distinct layout situation, i.e., a different combination of known vs. unknown attributes. Technically, our specifications are relational attribute grammars, while our engines are functional attribute grammars. By synthesizing functions from relational constraints, we obviate the need for constraint solving at runtime, because functional attribute grammars can be easily evaluated according to a fixed schedule, sidestepping the backtracking search performed by constraint solvers. Our experiments show that we can generate layout engines for non-trivial data visualizations, and that our synthesized engines are between 39- and 200-times faster than general-purpose constraint solvers. Relational specifications of layout give rise to synthesis problems that have previously proved intractable. Our algorithm exploits the hierarchical, grammar-based structure of the specification, decomposing the specification into smaller subproblems, which can be tackled with off-the-shelf synthesis procedures. The new synthesis problem then becomes the composition of the functions thus generated into a correct attribute grammar, which might be recursive. We show how to solve this problem by efficient reduction to an SMT problem.
- published: 02 Nov 2015
- views: 59
Understanding Energy Behaviors of Concurrent Programs -- OOPSLA'14
- Order: Reorder
- Duration: 0:31
- Updated: 21 Oct 2014
- views: 57
Ads for our talk at OOPSLA'14
Ads for our talk at OOPSLA'14
wn.com/Understanding Energy Behaviors Of Concurrent Programs Oopsla'14
Christopher Alexander - Patterns in Architecture
- Order: Reorder
- Duration: 63:36
- Updated: 09 Sep 2013
- views: 20036
The following presentation was recorded live in San Jose, California, October of 1996, at The 1996 ACM Conference on Object-Oriented Programs, Systems, Language...
The following presentation was recorded live in San Jose, California, October of 1996, at The 1996 ACM Conference on Object-Oriented Programs, Systems, Languages and Applications (OOPSLA).
A full transcript of this talk is available here: http://www.patternlanguage.com/archive/ieee/ieeetext.htm
Video transcoded from VHS and provided by The Understanding Group (TUG): http://understandinggroup.com/2011/11/christopher-alexander-from-1996-patterns-in-architecture/
wn.com/Christopher Alexander Patterns In Architecture
The following presentation was recorded live in San Jose, California, October of 1996, at The 1996 ACM Conference on Object-Oriented Programs, Systems, Languages and Applications (OOPSLA).
A full transcript of this talk is available here: http://www.patternlanguage.com/archive/ieee/ieeetext.htm
Video transcoded from VHS and provided by The Understanding Group (TUG): http://understandinggroup.com/2011/11/christopher-alexander-from-1996-patterns-in-architecture/
- published: 09 Sep 2013
- views: 20036
close fullscreen
- Playlist
- Chat
close fullscreen
- Playlist
- Chat
61:23
[OOPSLA Keynote] How Dart Learned From Past Object-Oriented Systems
Talk Title: How Dart Learned From Past Object-Oriented Systems
Presenter: Lars Bak
More In...
published: 02 Nov 2015
[OOPSLA Keynote] How Dart Learned From Past Object-Oriented Systems
[OOPSLA Keynote] How Dart Learned From Past Object-Oriented Systems
- Report rights infringement
- published: 02 Nov 2015
- views: 725
64:34
Alan Kay at OOPSLA 1997 - The computer revolution hasnt happened yet
Alan Kay's seminal 1997 OOPSLA keynote. Originally hosted on Google Video, copies of it a...
published: 12 Feb 2013
Alan Kay at OOPSLA 1997 - The computer revolution hasnt happened yet
Alan Kay at OOPSLA 1997 - The computer revolution hasnt happened yet
- Report rights infringement
- published: 12 Feb 2013
- views: 29922
6:37
OOPSLA 2001
Smalltalk/Squeak @ OOPSLA 2001
Taken with a webcam.
published: 04 Oct 2014
OOPSLA 2001
OOPSLA 2001
- Report rights infringement
- published: 04 Oct 2014
- views: 713
19:36
[OOPSLA] Versatile yet Lightweight Record-and-Replay for Android
Talk Title: Versatile yet Lightweight Record-and-Replay for Android
Presenter: Yongjian Hu...
published: 02 Nov 2015
[OOPSLA] Versatile yet Lightweight Record-and-Replay for Android
[OOPSLA] Versatile yet Lightweight Record-and-Replay for Android
- Report rights infringement
- published: 02 Nov 2015
- views: 37
1:32
OOPSLA 2007 Band
OOPSLA participants (and the General Chair) gives a taste about how making accidental live...
published: 25 Oct 2007
OOPSLA 2007 Band
OOPSLA 2007 Band
- Report rights infringement
- published: 25 Oct 2007
- views: 580
2:06
OOPSLA 2007 Painel (There is no silver bullet)
A panel at OOPSLA'07 with Frederick Brooks, Martin Fowler, Linda Northrop, David Parnas, a...
published: 25 Oct 2007
OOPSLA 2007 Painel (There is no silver bullet)
OOPSLA 2007 Painel (There is no silver bullet)
- Report rights infringement
- published: 25 Oct 2007
- views: 7363
16:59
[OOPSLA] FlashMeta: A Framework for Inductive Program Synthesis
Talk Title: FlashMeta: A Framework for Inductive Program Synthesis
Presenter: Oleksandr Po...
published: 02 Nov 2015
[OOPSLA] FlashMeta: A Framework for Inductive Program Synthesis
[OOPSLA] FlashMeta: A Framework for Inductive Program Synthesis
- Report rights infringement
- published: 02 Nov 2015
- views: 82
6:56
X10 wins 2005 ACM SIGPLAN OOPSLA Most Influential Paper Award
Vijay Saraswat accepts the OOPSLA Most Influential Paper Award for the original X10 paper:...
published: 04 Nov 2015
X10 wins 2005 ACM SIGPLAN OOPSLA Most Influential Paper Award
X10 wins 2005 ACM SIGPLAN OOPSLA Most Influential Paper Award
- Report rights infringement
- published: 04 Nov 2015
- views: 165
24:22
[OOPSLA] Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
Talk Title: Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
...
published: 02 Nov 2015
[OOPSLA] Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
[OOPSLA] Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
- Report rights infringement
- published: 02 Nov 2015
- views: 150
20:06
[OOPSLA] Synthesis of Layout Engines from Relational Constraints
Talk Title: Synthesis of Layout Engines from Relational Constraints
Presenter: Thibaud Hot...
published: 02 Nov 2015
[OOPSLA] Synthesis of Layout Engines from Relational Constraints
[OOPSLA] Synthesis of Layout Engines from Relational Constraints
- Report rights infringement
- published: 02 Nov 2015
- views: 59
0:31
Understanding Energy Behaviors of Concurrent Programs -- OOPSLA'14
Ads for our talk at OOPSLA'14
published: 21 Oct 2014
Understanding Energy Behaviors of Concurrent Programs -- OOPSLA'14
Understanding Energy Behaviors of Concurrent Programs -- OOPSLA'14
- Report rights infringement
- published: 21 Oct 2014
- views: 57
63:36
Christopher Alexander - Patterns in Architecture
The following presentation was recorded live in San Jose, California, October of 1996, at ...
published: 09 Sep 2013
Christopher Alexander - Patterns in Architecture
Christopher Alexander - Patterns in Architecture
- Report rights infringement
- published: 09 Sep 2013
- views: 20036
![[OOPSLA Keynote] How Dart Learned From Past Object-Oriented](http://web.archive.org./web/20160513232040/http://i.ytimg.com/vi/h6z-5d-OlcQ/0.jpg)
[OOPSLA Keynote] How Dart Learned From Past Object...
Alan Kay at OOPSLA 1997 - The computer revolution ...
OOPSLA 2001...
![[OOPSLA] Versatile yet Lightweight Record-and-Replay for And](http://web.archive.org./web/20160513232040/http://i.ytimg.com/vi/7uDDrCyH2mA/0.jpg)
[OOPSLA] Versatile yet Lightweight Record-and-Repl...
OOPSLA 2007 Band...
OOPSLA 2007 Painel (There is no silver bullet)...
![[OOPSLA] FlashMeta: A Framework for Inductive Program Synthe](http://web.archive.org./web/20160513232040/http://i.ytimg.com/vi/FhQrKmZkid0/0.jpg)
[OOPSLA] FlashMeta: A Framework for Inductive Prog...
X10 wins 2005 ACM SIGPLAN OOPSLA Most Influential ...
![[OOPSLA] Learning a Strategy for Adapting a Program Analysis](http://web.archive.org./web/20160513232040/http://i.ytimg.com/vi/0UrIob78rH0/0.jpg)
[OOPSLA] Learning a Strategy for Adapting a Progra...
![[OOPSLA] Synthesis of Layout Engines from Relational Constra](http://web.archive.org./web/20160513232040/http://i.ytimg.com/vi/ehFHpo2YiPo/0.jpg)
[OOPSLA] Synthesis of Layout Engines from Relation...
Understanding Energy Behaviors of Concurrent Progr...
Christopher Alexander - Patterns in Architecture...
-
Lyrics list:lyrics
-
Joe Pizzulo
Joe Pizzulo
I'd rather know if you had turned the page
If you go faster than I do
Suddenly it's not so clear just what I am to you
Am I friend, am I lover, do we still need each other
When you touch me, when you touch me baby I can tell
What do we mean to each other, am I friend, am I lover is it over now
If this is it then why bother tell me where do we take it from here
What do we mean to each other am I friend, am I lover, is it over now
Do you love me still or do you just mean well
I can see clearly how I'm hurting you
Every breath gives you a way
All we go on separate roads has gone in the way.
Am I friend, am I lover, do we still need each other
When you hold me, when you hold me baby I can tell
What do we mean to each other, am I friend, am I lover is it over now
If this is it then why bother tell me where do we take it from here
What do we mean to each other am I friend, am I lover, is it over now
Do you love me still or do you just mean well
Time became a poison looking slowly on my home
Screwing all the memories, Is it tearing us apart
When you touch me, when you touch me baby I can tell
What do we mean to each other, am I friend, am I lover is it over now
If this is it then why bother tell me where do we take it from here
What do we mean to each other am I friend, am I lover, is it over now
Do you love me still or do you just mean well
What do we mean to each other, am I friend, am I lover is it over now
Do you love me still or do you just mean well
photo: Creative Commons / Cobatfor
British Fighter Jets Intercept 'Aggressive' Russian Aircraft Approaching Baltic States
Edit Newsweek 13 May 2016
British fighter jets were scrambled to intercept three Russian planes that committed an “act of aggression,” the U.K.'s defence secretary said. RAF Typhoons left their base in Estonia to obstruct the planes which were approaching Baltic countries ... Try Newsweek. Subscription offers....
photo: AP / Eric Risberg
Is Nonviolence Even Possible In America Or At Trump Rallies?
Edit WorldNews.com 13 May 2016
Article by WN.com Correspondent Dallas Darling. Slavery and segregation is inherently violent, and so was the urban race riots and black militants of the 1960’s; the beating of the black man Rodney King by Los Angeles police in 1992, and uprising that followed the acquittal of the police officers who beat King; the attacks on Sept ... And yet, deliberate nonviolent civil disobedience was embodied by one of the greatest activists. Dr....
photo: Via YouTube
U.S. must beware China's 'Guam killer' missile
Edit CNN 13 May 2016
(CNN)Capable of hitting targets 3,400 miles away, China's "Guam killer" missile is raising new fears of a growing Chinese threat to major U.S. military installations and stability in the Pacific Rim. A congressional panel has issued a report warning of the dangers of the missile, during a week in which U.S.-China tensions flared anew with a U.S. Navy destroyer sailing close to a Chinese-claimed island in the South China Sea ... Read More ... ....
photo: AP / Jason Reed, Pool
Netanyahu Tells Officials 'It's About Time' For Abbas To Accept Peace Talk Offer
Edit WorldNews.com 12 May 2016
Declaring, “It’s about time,” Israeli Prime Minister Benjamin Netanyahu urged heads of diplomatic missions and religious communities on Thursday to encourage Palestinian Authority President Mahmoud Abbas to accept his offer to talk peace, The Jerusalem Post reported.Netanyahu said he is willing to sit down with Abbas in Jerusalem, Ramallah or anywhere else he might be willing to meet....
photo: Creative Commons / DAVID ILIFF
Central bankers are considering ‘dropping money from the sky’ to prop up the economy
Edit The Independent 13 May 2016« back to news headlines
Harnessing error-prone chips (MIT - Massachusetts Institute of Technology)
Edit noodls 30 Oct 2014
(Source. MIT - Massachusetts Institute of Technology). As transistors get smaller, they also grow less reliable ... At this year's Object-Oriented Programming, Systems, Languages and Applications (OOPSLA) conference, researchers from MIT's Computer Science and Artificial Intelligence Laboratory presented a new system that lets programmers identify sections of their code that can tolerate a little error ... Accumulating results ... distributed by....
Powerful New Software Plug-in Detects Bugs in Spreadsheets (University of Massachusetts Amherst)
Edit noodls 23 Oct 2014
(Source. University of Massachusetts Amherst). AMHERST, Mass ... He spoke at the premier international computer programming language design conference known as OOPSLA, in Portland, Ore ... Its release at the highly respected Object-Oriented Programming, Systems, Languages and Applications (OOPSLA) conference this week signals that it is now freely available to anyone who wants to use it ... Poor quality data costs everyone money ... distributed by....
New ‘Surveyman’ Software Promises to Revolutionize Survey Design and Accuracy (University of Massachusetts Amherst)
Edit noodls 22 Oct 2014
(Source. University of Massachusetts Amherst). AMHERST, Mass ... Tosch's talk at the Object-oriented Programming, Systems, Languages and Applications (OOPSLA) conference will release Surveyman to assist economists, sociologists, psychologists and professionals in politics, marketing, industry, public health, news and public opinion who increasingly use online surveys to gauge opinion and guide information and marketing campaigns ... (noodl....
- 1
- 2
- 3
- 4
- 5
- Next page »
