Sciweavers

756 search results - page 114 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
OTM
2005
Springer
14 years 1 months ago
Selection Using Non-symmetric Context Areas
Abstract. This paper targets with applications running on mobile devices and using context informations. Following previous studies from other authors, we extend the notion of cont...
Diane Lingrand, Stephane Lavirotte, Jean-Yves Tigl...
ECOOP
2008
Springer
13 years 10 months ago
Programming with Live Distributed Objects
A component revolution is underway, bringing developers improved productivity and opportunities for code reuse. However, whereas existing tools work well for builders of desktop ap...
Krzysztof Ostrowski, Ken Birman, Danny Dolev, Jong...
QEST
2007
IEEE
14 years 2 months ago
GRIP: Generic Representatives in PRISM
We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications. 1 ...
Alastair F. Donaldson, Alice Miller, David Parker
ECOOP
2000
Springer
14 years 15 days ago
Runtime Support for Type-Safe Dynamic Java Classes
Modern software must evolve in response to changing conditions. In the most widely used programming environments, code is static and cannot change at runtime. This poses problems ...
Scott Malabarba, Raju Pandey, Jeff Gragg, Earl T. ...