1882 search results - page 24 / 377 » Transformational Programming and Forests |
165
click to vote
NMELP
1994
15 years 9 months ago
1994
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
132
click to vote
SRDS
2003
IEEE
15 years 10 months ago
2003
IEEE
The perfectly synchronized round model provides the abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We p...
142
click to vote
ASP
2001
Springer
15 years 9 months ago
2001
Springer
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
189
click to vote
JAR
2008
15 years 5 months ago
2008
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
153
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...