Sciweavers

391 search results - page 66 / 79
» Computational Challenges in Cell Simulation: A Software Engi...
Sort
View
PLDI
2010
ACM
13 years 11 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
TCAD
2011
13 years 2 months ago
Low-Power Clock Tree Design for Pre-Bond Testing of 3-D Stacked ICs
—Pre-bond testing of 3-D stacked integrated circuits (ICs) involves testing each individual die before bonding. The overall yield of 3-D ICs improves with pre-bond testability be...
Xin Zhao, Dean L. Lewis, Hsien-Hsin S. Lee, Sung K...
HICSS
2007
IEEE
141views Biometrics» more  HICSS 2007»
14 years 1 months ago
Second-Best Combinatorial Auctions - The Case of the Pricing-Per-Column Mechanism
One of the main contributions of classical mechanism design is the derivation of the Groves mechanisms. The class of Groves mechanisms are the only mechanisms that are strategy-pr...
Dirk Neumann, Björn Schnizler, Ilka Weber, Ch...
EMSOFT
2006
Springer
13 years 11 months ago
Modeling a system controller for timing analysis
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
Stephan Thesing
ICST
2009
IEEE
14 years 2 months ago
Using JML Runtime Assertion Checking to Automate Metamorphic Testing in Applications without Test Oracles
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...
Christian Murphy, Kuang Shen, Gail E. Kaiser