132 search results - page 10 / 27 » A Rewriting Logic Semantics Approach to Modular Program Anal... |
117
Voted
AMAST
1998
Springer
15 years 6 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...
149
Voted
ICLP
1992
Springer
15 years 6 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...
157
click to vote
PEPM
2010
ACM
15 years 4 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...
137
Voted
CSL
2007
Springer
15 years 8 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...
128
click to vote
EUROSYS
2007
ACM
15 years 6 months ago
2007
ACM
Middleware simplifies the construction of distributed applications. These applications typically require continuous uptime. The maintenance of distributed applications, though, im...