1716 search results - page 172 / 344 » Proving Conditional Termination |
91
Voted
SIAMNUM
2011
14 years 7 months ago
2011
We prove a posteriori error estimates for time discrete approximations, for semilinear parabolic equations with solutions that might blow-up in finite time. In particular we consi...
90
Voted
MOC
2010
14 years 7 months ago
2010
Abstract. The aim of this paper is to present and analyze a class of hpversion discontinuous Galerkin (DG) discretizations for the numerical approximation of linear elliptic proble...
92
Voted
NHM
2010
14 years 7 months ago
2010
We consider a so-called random obstacle model for the motion of a hypersurface through a field of random obstacles, driven by a constant driving field. The resulting semilinear par...
78
Voted
DATE
2008
IEEE
15 years 7 months ago
2008
IEEE
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
144
click to vote
ACL2
2006
ACM
15 years 6 months ago
2006
ACM
A verifying compiler is one that emits both object code and a proof of correspondence between object and source code.1 We report the use of ACL2 in building a verifying compiler f...