10055 search results - page 153 / 2011 » Structured programming using processes |
POPL
1999
ACM
14 years 1 months ago
1999
ACM
hought of as abstract interpretation for the heap How we talk about the heap Program var X points to U that has an N field pointing to V We use first order predicate logic ¡...
FUIN
2006
13 years 9 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
DSL
2009
13 years 7 months ago
2009
Traversals of heterogeneous object structures are the most common operations in schema-first applications where the three key issues are (1) separation of traversal specifications ...
PPOPP
2012
ACM
12 years 4 months ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
BMCBI
2008
13 years 9 months ago
2008
Background: Virtual or in silico ligand screening combined with other computational methods is one of the most promising methods to search for new lead compounds, thereby greatly ...