Sciweavers

5130 search results - page 755 / 1026
» Constraint Query Languages
Sort
View
POPL
2007
ACM
16 years 7 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
POPL
2009
ACM
16 years 1 months ago
Declarative aspects of memory management in the concurrent collections parallel programming model
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
Zoran Budimlic, Aparna Chandramowlishwaran, Kathle...
MIDDLEWARE
2007
Springer
16 years 1 months ago
Flexible matching and ranking of web service advertisements
With the growing number of service advertisements in service marketplaces, there is a need for matchmakers which select and rank functionally similar services based on nonfunction...
Navid Ahmadi, Walter Binder
PLDI
2003
ACM
16 years 8 days ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
CAV
2010
Springer
194views Hardware» more  CAV 2010»
15 years 11 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber