Genaim, S. and King, Andy (2003) Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. In: Degano, Pierpaolo, ed. Lecture Notes In Computer Science. Lecture Notes in Computer Science, 2618. Springer-Verlag pp. 84-98. ISBN 3-540-00886-1 .
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial point is that the analysis does not verify that an (abstract) goal does not lead to suspension but rather it infers (abstract) goals which do not lead to suspension.
|Item Type:||Conference or workshop item (UNSPECIFIED)|
|Additional information:||Also see http://www.springer.de/comp/lncs/index.html Conference Information: Joint European Conference on Theory and Practice of Software (ETAPS 2003) WARSAW, POLAND, APR 05-13, 2003 Warsaw Univ; Inst Informatics; Fdn Informat Technol Dev; European Assoc Theoret Comp Sci; European Assoc Programming Languages & Syst; European Assoc Software Sci & Technol; ACM SIGACT; ACM SIGSOFT; ACM SIGPLAN|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 18:01|
|Last Modified:||08 Jun 2012 14:54|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13994 (The current URI for this page, for reference purposes)|
- Depositors only (login required):