1445 search results - page 174 / 289 » Abstract Interpretation of Logic Programs |
176
click to vote
PLDI
2009
ACM
16 years 1 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
172
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL wit...
163
click to vote
ICCS
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. This paper presents a prototype implementation of an intelligent assistance architecture for data-driven simulation specialising in qualitative data in the social science...
162
click to vote
POPL
1995
ACM
15 years 9 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...
167
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...