Sciweavers

272 search results - page 10 / 55
» Programming languages capturing complexity classes
Sort
View
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 4 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
ECOOP
2008
Springer
13 years 9 months ago
Safe Cross-Language Inheritance
Inheritance is a standard means for reuse and for interfacing with external libraries. In a multi-language software product, extending a class written in a statically-typed languag...
Kathryn E. Gray
TOOLS
1999
IEEE
13 years 11 months ago
Towards Integration of State Machines and Object-Oriented Languages
The goal of this paper is to obtain a one-to-one correspondence between state machines as e.g. used in UML and object-oriented programming languages. A proposal is made for a lang...
Ole Lehrmann Madsen
ICALP
2009
Springer
14 years 15 hour ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
AOSD
2007
ACM
13 years 11 months ago
Improve pointcut definitions with program views
Aspect-oriented programming languages select join points using pointcut constructs that depend on the syntactic structure of the base program. As the base program evolves, the poi...
Zifu Yang, Tian Zhao