Sciweavers

1724 search results - page 39 / 345
» Abstract Interpreters for Free
Sort
View
JCSS
2002
58views more  JCSS 2002»
14 years 9 months ago
Context-Free Languages of Sub-exponential Growth
Abstract. There do not exist context
Martin R. Bridson, Robert H. Gilman
DLT
2009
14 years 7 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu
FUIN
2008
56views more  FUIN 2008»
14 years 10 months ago
Specification and Verification of Invariants by Exploiting Layers in OO Designs
Abstract. The layering that is present in many OO designs is not accounted for in current interpretations of invariants. We propose to make layers explicit in specifications and in...
Ronald Middelkoop, Cornelis Huizing, Ruurd Kuiper,...
SAT
2007
Springer
73views Hardware» more  SAT 2007»
15 years 4 months ago
SAT Solving for Termination Analysis with Polynomial Interpretations
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, ...
FUIN
2006
63views more  FUIN 2006»
14 years 10 months ago
Interpreted Trajectories
Abstract. We introduce generalized trajectories where the individual symbols are interpreted as operations performed on the operand words. The various previously considered traject...
Michael Domaratzki, Grzegorz Rozenberg, Kai Saloma...