Sciweavers

1914 search results - page 296 / 383
» Verification by Abstract Interpretation
Sort
View
ICFP
2012
ACM
12 years 1 months ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...
EMSOFT
2007
Springer
14 years 5 months ago
Proving the absence of run-time errors in safety-critical avionics code
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
Patrick Cousot
CAV
1999
Springer
119views Hardware» more  CAV 1999»
14 years 3 months ago
Exploiting Positive Equality in a Logic of Equality with Uninterpreted Functions
Abstract. In using the logic of equality with unininterpreted functions to verify hardware systems, specific characteristics of the formula describing the correctness condition ca...
Randal E. Bryant, Steven M. German, Miroslav N. Ve...
HOTOS
1997
IEEE
14 years 3 months ago
The Role of Trace Modulation in Building Mobile Computing Systems
ty of accurately re-creating a mobile networkingAbstract environment in vitro argues for live experiments. On the In this paper we put forth the view that trace other hand, the dif...
Mahadev Satyanarayanan, Brian Noble
MICRO
2008
IEEE
93views Hardware» more  MICRO 2008»
13 years 11 months ago
What Kinds of Computer-Software-Related Advances (if Any) Are Eligible for Patents? Part II: The "Useful Arts" Requirement
of nature, or abstract idea (collectively, a principle). The clue to the patent-eligibility of processes that do not involve substance-transformation is whether the process impleme...
Richard Stern