2944 search results - page 352 / 589 » Robust Semantic Construction |
299
click to vote
PADL
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
293
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
157
click to vote
ICFP
2006
ACM
16 years 6 months ago
2006
ACM
nt programs require high-level abstractions in order to manage complexity and enable compositional reasoning. In this paper, we introduce a novel concurrency abstraction, dubbed t...
191
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
166
click to vote
ICFP
2001
ACM
16 years 6 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...