Sciweavers

503 search results - page 76 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
PLDI
2010
ACM
15 years 7 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
TACAS
2005
Springer
108views Algorithms» more  TACAS 2005»
15 years 3 months ago
On Some Transformation Invariants Under Retiming and Resynthesis
Transformations using retiming and resynthesis operations are the most important and practical (if not the only) techniques used in optimizing synchronous hardware systems. Althoug...
Jie-Hong Roland Jiang
ECCC
2011
188views ECommerce» more  ECCC 2011»
14 years 4 months ago
Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
Anna Gál, Andrew Mills
MICRO
2009
IEEE
129views Hardware» more  MICRO 2009»
15 years 4 months ago
Execution leases: a hardware-supported mechanism for enforcing strong non-interference
High assurance systems such as those found in aircraft controls and the financial industry are often required to handle a mix of tasks where some are niceties (such as the contro...
Mohit Tiwari, Xun Li, Hassan M. G. Wassel, Frederi...
LATA
2009
Springer
15 years 4 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig