91 search results - page 10 / 19 » Towards a General Argumentation System based on Answer-Set P... |
RTSS
1996
IEEE
15 years 3 months ago
1996
IEEE
We present an integrated framework for developing realtime systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work...
TACAS
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
105
Voted
POPL
1998
ACM
15 years 3 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
CACM
1998
14 years 11 months ago
1998
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...
108
click to vote
SAC
2010
ACM
14 years 9 months ago
2010
ACM
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...