956 search results - page 90 / 192 » Languages as libraries |
112
click to vote
ICFP
2003
ACM
16 years 5 months ago
2003
ACM
We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and effic...
131
click to vote
ICFP
2003
ACM
16 years 5 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
107
click to vote
ESOP
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. We propose a new formalisation of stability for Rely-Guarantee, in which an assertion's stability is encoded into its syntactic form. This allows two advances in mod...
113
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
109
click to vote
OOPSLA
2009
Springer
15 years 11 months ago
2009
Springer
Model transformation languages, the cornerstone of Modelngineering, often lack mechanisms for abstraction, reuse and debugging. We propose a model transformation k providing diffe...