227 search results - page 35 / 46 » A Model Theory for Paraconsistent Logic Programming |
POPL
2007
ACM
14 years 8 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
FASE
2009
Springer
14 years 10 days ago
2009
Springer
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
CCS
2005
ACM
14 years 2 months ago
2005
ACM
We study formal security properties of network-attached storage (NAS) in an applied pi calculus. We model NAS as an implementation of a specification based on traditional central...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...