1226 search results - page 53 / 246 » Proofs, Programs and Abstract Complexity |
114
Voted
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
151
click to vote
KBSE
2000
IEEE
15 years 6 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
239
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
158
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
171
click to vote
ESOP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...