132 search results - page 10 / 27 » A Rewriting Logic Semantics Approach to Modular Program Anal... |
AMAST
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
ICLP
1992
Springer
13 years 11 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
PEPM
2010
ACM
13 years 9 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
EUROSYS
2007
ACM
13 years 11 months ago
2007
ACM
Middleware simplifies the construction of distributed applications. These applications typically require continuous uptime. The maintenance of distributed applications, though, im...