Sciweavers

1096 search results - page 19 / 220
» Abstract Canonical Inference
Sort
View
ESOP
2003
Springer
15 years 2 months ago
Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling
Abstract. A goal-independent suspension analysis is presented that infers a class of goals for which a logic program with delays can be executed without suspension. The crucial poi...
Samir Genaim, Andy King
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
15 years 3 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
IHIS
2005
ACM
15 years 3 months ago
An architecture for the interoperability of workflow models
The goal of this work is to contribute to the field of interoperability of Workflow models. To achieve this interoperability, we have built a generic architecture that s three lev...
Salah Hamri, Mahmoud Boufaïda, Nacer Boudjlid...
JANCL
2008
170views more  JANCL 2008»
14 years 9 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
ICSE
1997
IEEE-ACM
15 years 1 months ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson