Sciweavers

526 search results - page 55 / 106
» Co-Logic Programming: Extending Logic Programming with Coind...
Sort
View
JAR
2002
72views more  JAR 2002»
13 years 7 months ago
Partial Instantiation Methods for Inference in First-Order Logic
Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-orde...
John N. Hooker, G. Rago, V. Chandru, A. Shrivastav...
ICLA
2011
Springer
12 years 11 months ago
A Stochastic Interpretation of Propositional Dynamic Logic: Expressivity
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
Ernst-Erich Doberkat
ATVA
2007
Springer
162views Hardware» more  ATVA 2007»
14 years 2 months ago
Verifying Heap-Manipulating Programs in an SMT Framework
Automated software verification has made great progress recently, and a key enabler of this progress has been the advances in efficient, automated decision procedures suitable fo...
Zvonimir Rakamaric, Roberto Bruttomesso, Alan J. H...
CCECE
2006
IEEE
14 years 2 months ago
AOP Extension for Security Testing of Programs
The purpose of this paper is to use the aspect-oriented programming (AOP) paradigm for security testing. AOP allows security experts to develop and inject separate modules for con...
Nadia Belblidia, Mourad Debbabi, Aiman Hanna, Zhen...
RISE
2004
Springer
14 years 1 months ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...