Sciweavers

899 search results - page 8 / 180
» Cost Analysis of Games, Using Program Logic
Sort
View
CSL
2006
Springer
15 years 3 months ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
POPL
2010
ACM
15 years 9 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
EOR
2007
123views more  EOR 2007»
14 years 11 months ago
Dynamic programming analysis of the TV game "Who wants to be a millionaire?"
This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionai...
Federico Perea, Justo Puerto
POPL
1999
ACM
15 years 4 months ago
Parametric Shape Analysis via 3-Valued Logic
hought of as abstract interpretation for the heap How we talk about the heap   Program var X points to U that has an N field pointing to V   We use first order predicate logic ¡...
Shmuel Sagiv, Thomas W. Reps, Reinhard Wilhelm
ISSTA
2010
ACM
15 years 1 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold