1916 search results - page 236 / 384 » Reasoning with class algebra |
ICLP
1993
Springer
14 years 2 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
FSTTCS
2006
Springer
14 years 1 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
LICS
1997
IEEE
14 years 1 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
ESEM
2007
ACM
13 years 12 months ago
2007
ACM
An important number of studies have addressed the importance of models in software engineering, mainly in the design of robust software systems. Although models have been proven t...