Sciweavers

361 search results - page 71 / 73
» Analytic Methods for the Logic of Proofs
Sort
View
MEMOCODE
2010
IEEE
13 years 5 months ago
Proving transaction and system-level properties of untimed SystemC TLM designs
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
Daniel Große, Hoang M. Le, Rolf Drechsler
EMSOFT
2007
Springer
14 years 1 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
SIGMOD
2005
ACM
127views Database» more  SIGMOD 2005»
14 years 7 months ago
Fossilized Index: The Linchpin of Trustworthy Non-Alterable Electronic Records
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly manag...
Qingbo Zhu, Windsor W. Hsu
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
14 years 27 days ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
CORR
2000
Springer
103views Education» more  CORR 2000»
13 years 7 months ago
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua S...