Sciweavers

643 search results - page 101 / 129
» A browser for incremental programming
Sort
View
ECOOP
2009
Springer
14 years 8 months ago
COPE - Automating Coupled Evolution of Metamodels and Models
Model-based development promises to increase productivity by offering modeling languages tailored to a specific domain. Such modeling languages are typically defined by a metamodel...
Elmar Jürgens, Markus Herrmannsdoerfer, Sebas...
CADE
2002
Springer
14 years 8 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
14 years 2 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
14 years 2 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
ACSC
2008
IEEE
14 years 2 months ago
Reasoning about inherent parallelism in modern object-oriented languages
In the future, if we are to continue to expect improved application performance we will have to achieve it by exploiting course-grained hardware parallelism rather then simply rel...
Wayne Reid, Wayne Kelly, Andrew Craik