2850 search results - page 247 / 570 » On Timed Models and Full Abstraction |
199
click to vote
DIALM
2010
ACM
15 years 4 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
185
click to vote
SAS
2009
Springer
16 years 7 months ago
2009
Springer
JavaScript is the main scripting language for Web browsers, and it is essential to modern Web applications. Programmers have started using it for writing complex applications, but ...
173
click to vote
CADE
2006
Springer
16 years 7 months ago
2006
Springer
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
194
click to vote
CC
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
181
click to vote
FMCAD
2009
Springer
16 years 1 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...