Sciweavers

899 search results - page 17 / 180
» Cost Analysis of Games, Using Program Logic
Sort
View
APSEC
2001
IEEE
15 years 3 months ago
A Slicing Method for Object-Oriented Programs Using Lightweight Dynamic Information
Program slicing has been used for efficient program debugging activities. Program slice is computed by analyzing dependence relations between program statements. We can divide dep...
Fumiaki Ohata, Kouya Hirose, Masato Fujii, Katsuro...
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
15 years 5 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ICLP
1997
Springer
15 years 3 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
ACMSE
2011
ACM
13 years 11 months ago
Integrating digital logic design and assembly programming using FPGAs in the classroom
Rising Field Programmable Gate Array (FPGA) market volumes combined with increasing industrial popularity have driven prices down and improved capability to the point that FPGA ha...
William M. Jones, D. Brian Larkins
APAL
2008
104views more  APAL 2008»
14 years 12 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy