Sciweavers

188 search results - page 18 / 38
» Back to the Complexity of Universal Programs
Sort
View
MP
2008
135views more  MP 2008»
13 years 7 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
PASTE
2005
ACM
14 years 29 days ago
Generalizing symbolic execution to library classes
Forward symbolic execution is a program analysis technique that allows using symbolic inputs to explore program executions. The traditional applications of this technique have foc...
Sarfraz Khurshid, Yuk Lai Suen
ICALP
2011
Springer
12 years 11 months ago
Liveness-Preserving Atomicity Abstraction
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...
Alexey Gotsman, Hongseok Yang
EDUTAINMENT
2007
Springer
14 years 1 months ago
UML in Action: Integrating Formal Methods in Industrial Design Education
When designing product behavior, the designer often needs to communicate to experts in computer software and protocols. In present-day software engineering, formal specification m...
Jun Hu, Philip Ross, Loe M. G. Feijs, Yuechen Qian
PLDI
1998
ACM
13 years 11 months ago
Optimizing Direct-threaded Code by Selective Inlining
Achieving good performance in bytecoded language interpreters is di cult without sacri cing both simplicity and portability. This is due to the complexity of dynamic translation (...
Ian Piumarta, Fabio Riccardi