Sciweavers

1882 search results - page 121 / 377
» Transformational Programming and Forests
Sort
View
NMELP
1994
15 years 2 months ago
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
Carolina Ruiz, Jack Minker
LCPC
1991
Springer
15 years 1 months ago
Experience in the Automatic Parallelization of Four Perfect-Benchmark Programs
This paper discusses the techniques used to hand-parallelize, for the Alliant FX/80, four Fortran programs from the Perfect-Benchmark suite. The paper also includes the execution ...
Rudolf Eigenmann, Jay Hoeflinger, Zhiyuan Li, Davi...
SLP
1997
89views more  SLP 1997»
14 years 11 months ago
Program Analysis via Graph Reachability
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
Thomas W. Reps
FAC
2006
104views more  FAC 2006»
14 years 10 months ago
Angelic nondeterminism in the unifying theories of programming
Hoare and He's unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates; it supports development in several programming paradigms. T...
Ana Cavalcanti, Jim Woodcock, Steve Dunne
CAV
2012
Springer
270views Hardware» more  CAV 2012»
13 years 10 days ago
Automated Termination Proofs for Java Programs with Cyclic Data
Abstract. In earlier work, we developed a technique to prove termination of Java programs automatically: first, Java programs are automatically transformed to term rewrite systems...
Marc Brockschmidt, Richard Musiol, Carsten Otto, J...