Sciweavers

2687 search results - page 100 / 538
» Formal Analysis of PKCS
Sort
View
115
Voted
SAS
2005
Springer
127views Formal Methods» more  SAS 2005»
15 years 9 months ago
Banshee: A Scalable Constraint-Based Analysis Toolkit
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resoluti...
John Kodumal, Alexander Aiken
SAS
1993
Springer
126views Formal Methods» more  SAS 1993»
15 years 8 months ago
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
Flemming Nielson, Hanne Riis Nielson
104
Voted
FMCAD
2000
Springer
15 years 7 months ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi
VMCAI
2005
Springer
15 years 9 months ago
An Overview of Semantics for the Validation of Numerical Programs
Interval computations, stochastic arithmetic, automatic differentiation, etc.: much work is currently done to estimate and to improve the numerical accuracy of programs but few c...
Matthieu Martel
ICFCA
2004
Springer
15 years 9 months ago
FCA in Knowledge Technologies: Experiences and Opportunities
Abstract. Managing knowledge is a difficult and slippery enterprise. A wide variety of technologies have to be invoked in providing support for knowledge requirements, ranging fro...
Yannis Kalfoglou, Srinandan Dasmahapatra, Yun-Heh ...