Sciweavers

1096 search results - page 35 / 220
» Type inference for atomicity
Sort
View
RR
2007
Springer
14 years 1 months ago
A Visualization Algorithm for Defeasible Logic Rule Bases over RDF Data
This work presents a visualization algorithm for defeasible logic rule bases as well as a software tool that applies this algorithm, according to which, a directed graph is produce...
Efstratios Kontopoulos, Nick Bassiliades, Grigoris...
APLAS
2010
ACM
13 years 8 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
ITP
2010
114views Mathematics» more  ITP 2010»
13 years 11 months ago
A New Foundation for Nominal Isabelle
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
Brian Huffman, Christian Urban
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
14 years 1 months ago
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
Qi Sun, Anindya Banerjee, David A. Naumann
TCS
2008
13 years 7 months ago
A typed lambda calculus with intersection types
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
Viviana Bono, Betti Venneri, Lorenzo Bettini