Sciweavers

504 search results - page 65 / 101
» Explaining Verification Conditions
Sort
View
SIAMREV
2010
119views more  SIAMREV 2010»
13 years 2 months ago
From Functional Analysis to Iterative Methods
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
Robert C. Kirby
KCAP
2005
ACM
14 years 1 months ago
Acquisition and maintenance of constraints in engineering design
The Designers’ Workbench is a system, developed by the Advanced Knowledge Technologies (AKT) consortium to support designers in large organizations, such as RollsRoyce, by makin...
Suraj Ajit, Derek H. Sleeman, David W. Fowler, Dav...
DAC
2004
ACM
14 years 9 months ago
A frequency relaxation approach for analog/RF system-level simulation
The increasing complexity of today's mixed-signal integrated circuits necessitates both top-down and bottom-up system-level verification. Time-domain state-space modeling and...
Xin Li, Yang Xu, Peng Li, Padmini Gopalakrishnan, ...
POPL
2009
ACM
14 years 8 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
POPL
2006
ACM
14 years 8 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam