1083 search results - page 170 / 217 » Using Contextual Logic Programming for Temporal Reasoning |
112
click to vote
LOPSTR
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
158
click to vote
ISSTA
2012
ACM
13 years 4 months ago
2012
ACM
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
124
click to vote
IEE
2008
15 years 2 months ago
2008
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
CSL
2004
Springer
15 years 7 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
158
click to vote
CCECE
2006
IEEE
15 years 8 months ago
2006
IEEE
Presenting information to an e-learning environment is a challenge, mostly, because ofthe hypertextlhypermedia nature and the richness ofthe context and information provides. This...