393 search results - page 31 / 79 » Probabilistic Description Logic Programs |
86
Voted
EMSOFT
2009
Springer
15 years 7 months ago
2009
Springer
In this paper, we propose a formal analysis approach to estimate the expected (average) data cache access time of an application across all possible program inputs. Towards this g...
208
click to vote
POPL
2007
ACM
16 years 24 days ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
72
Voted
PAPM
2001
Springer
15 years 4 months ago
2001
Springer
This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs – such ...
121
Voted
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
121
click to vote
CCL
1994
Springer
15 years 4 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...