Sciweavers

227 search results - page 25 / 46
» A Model Theory for Paraconsistent Logic Programming
Sort
View
APLAS
2004
ACM
14 years 1 months ago
A Relational Model for Object-Oriented Designs
This paper develops a mathematical characterisation of object-oriented concepts by defining an observation-oriented semantics for an object-oriented language (OOL) with a rich var...
Jifeng He, Zhiming Liu, Xiaoshan Li, Shengchao Qin
ATAL
2005
Springer
14 years 2 months ago
A computationally grounded logic of knowledge, belief and certainty
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...
Kaile Su, Abdul Sattar, Guido Governatori, Qinglia...
SIGSOFT
2005
ACM
14 years 9 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
PLDI
2009
ACM
14 years 3 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
POPL
2006
ACM
14 years 8 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...