1226 search results - page 111 / 246 » Proofs, Programs and Abstract Complexity |
142
click to vote
CCS
2003
ACM
15 years 8 months ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
159
Voted
PLANX
2007
15 years 4 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
156
click to vote
ECOOP
2010
Springer
15 years 8 months ago
2010
Springer
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
233
Voted
POPL
2009
ACM
16 years 4 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...
112
Voted
IROS
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot communication is limited to immediate ne...