1020 search results - page 178 / 204 » Tight Semantics for Logic Programs |
143
Voted
FOIKS
2006
Springer
15 years 6 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
123
Voted
EMSOFT
2007
Springer
15 years 8 months ago
2007
Springer
We explain the design of the interpretation-based static analyzer Astr´ee and its use to prove the absence of run-time errors in safety-critical codes. Categories and Subject Des...
128
Voted
AOSD
2007
ACM
15 years 6 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
143
click to vote
EMSOFT
2004
Springer
15 years 8 months ago
2004
Springer
Data flow process networks are a good model of computation for streaming multimedia applications incorporating audio, video and/or graphics streams. Process networks are concurre...
104
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...