Sciweavers

529 search results - page 9 / 106
» Simple Random Logic Programs
Sort
View
COCOON
2003
Springer
14 years 3 months ago
Petri Nets with Simple Circuits
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...
Hsu-Chun Yen, Lien-Po Yu
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 10 months ago
Depth as Randomness Deficiency
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...
Luis Antunes 0002, Armando Matos, Andre Souto, Pau...
ESOP
2006
Springer
14 years 1 months ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
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...
Limin Jia, David Walker
PEPM
2009
ACM
14 years 6 months ago
Linear logical approximations
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...
Robert J. Simmons, Frank Pfenning
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
14 years 3 months ago
Information Flow Analysis in Logical Form
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...
Torben Amtoft, Anindya Banerjee