Sciweavers

244 search results - page 20 / 49
» A Way to Interpret Lukasiewicz Logic and Basic Logic
Sort
View
POPL
2003
ACM
14 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
LOGCOM
2000
63views more  LOGCOM 2000»
13 years 7 months ago
Reflection principles in computational logic
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
Jonas Barklund, Pierangelo Dell'Acqua, Stefania Co...
TWEB
2008
66views more  TWEB 2008»
13 years 7 months ago
An environment for flexible advanced compensations of Web service transactions
tions at runtime. We introduce the abstract service and adapter components which allow us to separate the compensation logic from the coordination logic. In this way, we can easily...
Michael Schäfer, Peter Dolog, Wolfgang Nejdl
JAC
2008
13 years 9 months ago
Tilings and model theory
In this paper we emphasize the links between model theory and tilings. More precisely, after giving the definitions of what tilings are, we give a natural way to have an interpreta...
Alexis Ballier, Emmanuel Jeandel
IPL
2010
94views more  IPL 2010»
13 years 6 months ago
Partial model checking via abstract interpretation
model checking via abstract interpretation N. De Francesco, G. Lettieri∗ , L. Martini, G. Vaglini Universit`a di Pisa, Dipartimento di Ingegneria dell’Informazione, sez. Inform...
Nicoletta De Francesco, Giuseppe Lettieri, Luca Ma...