Sciweavers

283 search results - page 23 / 57
» Effective Program Verification for Relaxed Memory Models
Sort
View
POPL
2008
ACM
16 years 9 hour ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
TCOM
2008
128views more  TCOM 2008»
14 years 11 months ago
Cross-Layer Rate and Power Adaptation Strategies for IR-HARQ Systems over Fading Channels with Memory: A SMDP-Based Approach
Abstract--Incremental-redundancy hybrid automatic repeatrequest (IR-HARQ) schemes are proposed in several wireless standards for increased throughput-efficiency and greater reliabi...
Ashok K. Karmokar, Dejan V. Djonin, Vijay K. Bharg...
ICFP
2010
ACM
15 years 23 days ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
ENTCS
2002
145views more  ENTCS 2002»
14 years 11 months ago
Combining Monitors for Runtime System Verification
Runtime verification permits checking system properties that cannot be fully verified off-line. This is particularly true when the system includes complex third-party components, ...
Joshua Levy, Hassen Saïdi, Tomás E. Ur...
DAC
2004
ACM
16 years 20 days ago
An integrated hardware/software approach for run-time scratchpad management
An ever increasing number of dynamic interactive applications are implemented on portable consumer electronics. Designers depend largely on operating systems to map these applicat...
Francesco Poletti, Paul Marchal, David Atienza, Lu...