Sciweavers

1073 search results - page 55 / 215
» Formal Program Development with Approximations
Sort
View
FM
2009
Springer
95views Formal Methods» more  FM 2009»
14 years 3 months ago
It's Doomed; We Can Prove It
Abstract. Programming errors found early are the cheapest. Tools applying to the early stage of code development exist but either they suffer from false positives (“noise”) or...
Jochen Hoenicke, K. Rustan M. Leino, Andreas Podel...
TYPES
2007
Springer
14 years 2 months ago
Attributive Types for Proof Erasure
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
Hongwei Xi
TPHOL
2007
IEEE
14 years 3 months ago
Simple Types in Type Theory: Deep and Shallow Encodings
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
François Garillot, Benjamin Werner
CSFW
2000
IEEE
14 years 1 months ago
Reasoning about Secrecy for Active Networks
In this paper we develop a language of mobile agents called uPLAN for describing the capabilities of active (programmable) networks. We use a formal semantics for uPLAN to demonst...
Pankaj Kakkar, Carl A. Gunter, Martín Abadi
UPP
2004
Springer
14 years 2 months ago
From Prescriptive Programming of Solid-State Devices to Orchestrated Self-organisation of Informed Matter
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
Klaus-Peter Zauner