288 search results - page 18 / 58 » Interactive Termination Proofs Using Termination Cores |
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
89
Voted
CADE
2003
Springer
15 years 9 months ago
2003
Springer
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...
TCS
2010
14 years 7 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...
87
Voted
IC
2004
14 years 10 months ago
2004
Individuals are interested in the semantic and not necessarily in the presentation of services. The service interaction has to support the quality of the human senses, and since q...
HUC
2000
Springer
15 years 1 months ago
2000
Springer
Although the age of information appliances is getting close, current remote control devices are too awkward, and we cannot control sophisticated equipments without using graphical ...