1763 search results - page 54 / 353 » A Formalization of Polytime Functions |
BMCBI
2006
14 years 9 months ago
2006
Background: Structural analysis of cellular interaction networks contributes to a deeper understanding of network-wide interdependencies, causal relationships, and basic functiona...
CSFW
2000
IEEE
15 years 1 months ago
2000
IEEE
Schneider's work on rank functions [14] provides a formal approach to verification of certain properties of a security protocol. However, he illustrates the approach only wit...
JISE
1998
14 years 9 months ago
1998
straction reduces the number of states necessary to perform formal verification while maintaining the functionality of the original model with respect to ifications to be verified....
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
IFL
2005
Springer
15 years 3 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...