Sciweavers

6274 search results - page 188 / 1255
» Proofs, Programs, Processes
Sort
View
SP
2000
IEEE
15 years 10 months ago
Searching for a Solution: Engineering Tradeoffs and the Evolution of Provably Secure Protocols
Tradeoffs are an important part of engineering security. Protocol security is important. So are efficiency and cost. This paper provides an early framework for handling such aspec...
John A. Clark, Jeremy L. Jacob
JFPLC
2000
15 years 7 months ago
Preuves infinies en Programmation logique
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
Mathieu Jaume
CORR
2006
Springer
110views Education» more  CORR 2006»
15 years 6 months ago
An Analysis of Arithmetic Constraints on Integer Intervals
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for thes...
Krzysztof R. Apt, Peter Zoeteweij
JANCL
2006
112views more  JANCL 2006»
15 years 6 months ago
KAT-ML: an interactive theorem prover for Kleene algebra with tests
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...
Kamal Aboul-Hosn, Dexter Kozen
DATE
2009
IEEE
64views Hardware» more  DATE 2009»
15 years 10 months ago
Speculative reduction-based scalable redundancy identification
The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inhere...
Hari Mony, Jason Baumgartner, Alan Mishchenko, Rob...