1027 search results - page 133 / 206 » Callgraph properties of executables |
289
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
163
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
170
Voted
FOSSACS
2005
Springer
16 years 6 days ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
180
click to vote
ICLP
2005
Springer
16 years 6 days ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
215
click to vote
HYBRID
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...