OOPSLA 2010 - PDF Preprint Papers

OOPSLA 2010 Security for Object-Oriented Systems

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed OOPSLA-2010 Paper

click to vote

OOPSLA
2010
Springer

269views Security Privacy» more OOPSLA 2010»

The Spoofax language workbench

13 years 9 months ago

Download www.st.ewi.tudelft.nl

Domain-speciﬁc languages offer high expressive power foa particular problem domain, abstracting over the accidental complexity associated with traditional software development. ...

Lennart C. L. Kats, Eelco Visser

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	269	The Spoofax language workbench	claim
2	246	Supporting dynamic, third-party code customizations in JavaScript using aspects	claim
3	188	Hera-JVM: a runtime system for heterogeneous multi-core architectures	claim
4	188	Back to the futures: incremental parallelization of existing sequential runtime systems	claim
5	184	Towards a tool-based development methodology for sense/compute/control applications	claim
6	183	G-Finder: routing programming questions closer to the experts	claim
7	176	Pinocchio: bringing reflection to life with first-class interpreters	claim
8	173	Concurrency by modularity: design patterns, a case in point	claim
9	172	Type classes as objects and implicits	claim
10	170	Cross-language, type-safe, and transparent object sharing for co-located managed runtimes	claim
11	165	Composable specifications for structured shared-memory communication	claim
12	163	Instrumentation and sampling strategies for cooperative concurrency bug isolation	claim
13	163	Concurrent programming with revisions and isolation types	claim
14	158	Efficient modular glass box software model checking	claim
15	155	Scalable and systematic detection of buggy inconsistencies in source code	claim
16	153	Modular logic metaprogramming	claim
17	152	MetaFJig: a meta-circular composition language for Java-like classes	claim
18	147	A simple inductive synthesis methodology and its applications	claim
19	145	Collaboration	claim
20	145	Almost free concurrency! (using GOF patterns)	claim
21	141	The spoofax language workbench: rules for declarative specification of languages and IDEs	claim
22	140	Ficticious: MicroLanguages for interactive fiction	claim
23	139	Managing ambiguity in programming by finding unambiguous examples	claim
24	139	Collaborative model merging	claim
25	139	A recommender for conflict resolution support in optimistic model versioning	claim
26	138	Parallel inclusion-based points-to analysis	claim
27	138	An input-centric paradigm for program dynamic optimizations	claim
28	137	Refactoring references for library migration	claim
29	136	Specifying and implementing refactorings	claim
30	136	The Tower of Babel did not fail	claim
31	135	Task types for pervasive atomicity	claim
32	133	Language virtualization for heterogeneous parallel computing	claim
33	132	Programming with time: cyber-physical programming with impromptu	claim
34	132	Ownership and immutability in generic Java	claim
35	132	From OO to FPGA: fitting round objects into square hardware?	claim
36	131	Mostly modular compilation of crosscutting concerns by contextual predicate dispatch	claim
37	131	Encapsulation and locality: a foundation for concurrency support in multi-language virtual machines?	claim
38	130	Component adaptation and assembly using interface relations	claim
39	129	Teaching and training developer-testing techniques and tool support	claim
40	128	Homogeneous family sharing	claim
41	127	Enabling expressive aspect oriented modular reasoning by translucid contracts	claim
42	123	Tribal ownership	claim
43	122	Better science through art	claim
44	120	What can the GC compute efficiently?: a language for heap assertions at GC time	claim
45	119	A time-aware type system for data-race protection and guaranteed initialization	claim
46	112	Random testing for higher-order, stateful programs	claim
47	112	Symbolic heap abstraction with demand-driven axiomatization of memory invariants	claim
48	109	The two-state solution: native and serializable continuations accord	claim
49	107	Patterns and statistical analysis for understanding reduced resource computing	claim
50	105	A dynamic evaluation of the precision of static heap abstractions	claim
51	101	Reasoning about multiple related abstractions with MultiStar	claim
52	99	Pure and declarative syntax definition: paradise lost and regained	claim
53	97	SPUR: a trace-based JIT compiler for CIL	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers