Sciweavers

2529 search results - page 244 / 506
» The Logical Structure of Binding
Sort
View
SIGSOFT
2010
ACM
15 years 4 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
ICFP
2007
ACM
16 years 6 months ago
Adding delimited and composable control to a production programming environment
Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advant...
Matthew Flatt, Gang Yu, Robert Bruce Findler, Matt...
SMA
2009
ACM
137views Solid Modeling» more  SMA 2009»
16 years 1 months ago
Hierarchical molecular interfaces and solvation electrostatics
Electrostatic interactions play a significant role in determining the binding affinity of molecules and drugs. While significant effort has been devoted to the accurate computat...
Chandrajit L. Bajaj, Shun-Chuan Albert Chen, Guoli...
CODES
2008
IEEE
16 years 1 months ago
Symbolic voter placement for dependability-aware system synthesis
This paper presents a system synthesis approach for dependable embedded systems. The proposed approach significantly extends previous work by automatically inserting fault detect...
Felix Reimann, Michael Glabeta, Martin Lukasiewycz...
186
Voted
GPCE
2007
Springer
16 years 26 days ago
Debugging macros
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...
Ryan Culpepper, Matthias Felleisen