3440 search results - page 577 / 688 » Logics For Context-Free Languages |
175
click to vote
ICLP
2005
Springer
16 years 11 days ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
175
click to vote
ICLP
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
164
click to vote
PPDP
2005
Springer
16 years 10 days ago
2005
Springer
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
161
click to vote
UML
2005
Springer
16 years 10 days ago
2005
Springer
The main drive for Model-Driven Architecture is that many software applications have to be deployed on a variety of platforms. The way MDA achieves this is by transforming a platfo...
179
click to vote
ASPLOS
2004
ACM
16 years 9 days ago
2004
ACM
Recent studies have suggested that the soft-error rate in microprocessor logic will become a reliability concern by 2010. This paper proposes an efficient error detection techniqu...