529 search results - page 9 / 106 » Simple Random Logic Programs |
117
Voted
COCOON
2003
Springer
15 years 6 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
108
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
142
Voted
ESOP
2006
Springer
15 years 4 months ago
2006
Springer
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
90
Voted
PEPM
2009
ACM
15 years 10 months ago
2009
ACM
ract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying ope...
106
Voted
SAS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...