Sciweavers

2604 search results - page 344 / 521
» General constant expressions for system programming language...
Sort
View
120
Voted
SIGSOFT
2003
ACM
16 years 5 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
IPPS
2007
IEEE
15 years 10 months ago
POET: Parameterized Optimizations for Empirical Tuning
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
Qing Yi, Keith Seymour, Haihang You, Richard W. Vu...
POS
1992
Springer
15 years 8 months ago
Supporting Large Persistent Stores using Conventional Hardware
Persistent programming systems are generally supported by an object store, a conceptually infinite object repository. Objects in such a repository cannot be directly accessed by u...
Francis Vaughan, Alan Dearle
150
Voted
ECOOP
2011
Springer
14 years 4 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 4 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei