1461 search results - page 109 / 293 » Analysis of Constraint Logic Programs |
FLOPS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
NGC
1998
Springer
14 years 9 months ago
1998
Springer
Much progress has been made in distributed computing in the areas of distribution structure, open computing, fault tolerance, and security. Yet, writing distributed applications r...
101
click to vote
CMSB
2007
Springer
15 years 4 months ago
2007
Springer
For modeling and analyzing regulatory networks based on qualitative information and possibly additional temporal constraints, approaches using hybrid automata can be very helpful. ...
TGC
2010
Springer
14 years 7 months ago
2010
Springer
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
PPDP
2010
Springer
14 years 8 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...