Sciweavers

1763 search results - page 62 / 353
» A Formalization of Polytime Functions
Sort
View
KBSE
1995
IEEE
15 years 9 months ago
Classification and Retrieval of Reusable Components Using Semantic Features
cation at some level of abstraction, abandoning the semantic information provided by the specification. In this paper, we propose a methodology that ships the overhead of formal re...
John Penix, Phillip Baraona, Perry Alexander
POPL
2012
ACM
14 years 1 months ago
A mechanized semantics for C++ object construction and destruction, with applications to resource management
We present a formal operational semantics and its Coq mechanization for the C++ object model, featuring object construction and destruction, shared and repeated multiple inheritan...
Tahina Ramananandro, Gabriel Dos Reis, Xavier Lero...
ITP
2010
156views Mathematics» more  ITP 2010»
15 years 10 months ago
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
Arthur Charguéraud
TPHOL
2007
IEEE
16 years 13 days 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
15 years 10 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