288 search results - page 30 / 58 » Interactive Termination Proofs Using Termination Cores |
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
For an agent to intelligently use specifications of executable protocols, it is necessary that the agent can quickly and correctly assess the outcomes of that protocol if it is ex...
96
Voted
AISC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
MHCI
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Finding books in large libraries can be difficult for novice library users. This paper presents the current status of SmartLibrary, a web-based guidance application helpi...
IESA
2007
14 years 11 months ago
2007
In this paper a methodology is presented to generate webforms for business documents directly from XML schemas. XML Schemas that are based on the UN/CEFACT Naming and Design Rules ...
TPHOL
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...