Sciweavers

632 search results - page 91 / 127
» Proving Invariants of Functional Programs
Sort
View
SIAMCOMP
2000
79views more  SIAMCOMP 2000»
15 years 8 days ago
Optimal Worst Case Formulas Comparing Cache Memory Associativity
ct Consider an arbitrary program P which is to be executed on a computer with two alternative cache memories. The rst cache has k sets and u blocks in each set, this is denoted a ...
Håkan Lennerstad, Lars Lundberg
POPL
2008
ACM
16 years 24 days ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
113
Voted
CDC
2009
IEEE
123views Control Systems» more  CDC 2009»
15 years 3 months ago
Dealing with stochastic reachability
Abstract— For stochastic hybrid systems, stochastic reachability is very little supported mainly because of complexity and difficulty of the associated mathematical problems. In...
Manuela L. Bujorianu
66
Voted
CAISE
2005
Springer
15 years 6 months ago
Automated Reasoning on Feature Models
Abstract Software Product Line (SPL) Engineering has proved to be an effective method for software production. However, in the SPL community it is well recognized that variability ...
David Benavides, Pablo Trinidad Martín-Arro...
APSEC
2002
IEEE
15 years 5 months ago
Symbolic Simulation of Hybrid Systems
Continuous action systems (CAS) is a formalism intended for modeling hybrid systems (systems that combine discrete control with continuous behavior), and proving properties about ...
Ralph-Johan Back, Cristina Cerschi Seceleanu, Jan ...