811 search results - page 25 / 163 » Probabilistic Semantics and Program Analysis |
106
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
103
click to vote
WCRE
2005
IEEE
15 years 3 months ago
2005
IEEE
We apply static analysis and symbolic interpretation techniques to reverse engineer the semantics of legacy assembler code. We examine the case of IBM-1800 programs in detail. Fro...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
CCS
1998
ACM
15 years 2 months ago
1998
ACM
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
APLAS
2010
ACM
14 years 10 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...