Sciweavers

632 search results - page 48 / 127
» Combining programming with theorem proving
Sort
View
EUSFLAT
2001
13 years 9 months ago
Similarity-based unification: a multi-adjoint approach
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming whi...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
USS
2004
13 years 9 months ago
Fixing Races for Fun and Profit: How to Use access(2)
It is well known that it is insecure to use the access(2) system call in a setuid program to test for the ability of the program's executor to access a file before opening sa...
Drew Dean, Alan J. Hu
ECAI
2010
Springer
13 years 9 months ago
On Semantic Update Operators for Answer-Set Programs
Logic programs under the stable models semantics, or answer-set programs, provide an expressive rule based knowledge representation framework, featuring formal, declarative and wel...
Martin Slota, João Leite
ERSHOV
2009
Springer
14 years 2 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner
ICFP
2010
ACM
13 years 9 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier