TLCA
2009
Springer
14 years 6 months ago
2009
Springer
Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanis...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
TLCA
2009
Springer
14 years 6 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
SPIN
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We present a new decision procedure for detecting property violations in pushdown models for concurrent programs that use lock-based synchronization, where each thread’...
SPIN
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal pre...
SPIN
2009
Springer
14 years 6 months ago
2009
Springer
: Most intrusion detection systems deployed today apply misuse detection as analysis method. Misuse detection searches for attack traces in the recorded audit data using predefined...
SPIN
2009
Springer
14 years 6 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
SPIN
2009
Springer
14 years 6 months ago
2009
Springer
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...