Sciweavers

103 search results - page 17 / 21
» Proof Systems for Effectively Propositional Logic
Sort
View
ISSTA
2000
ACM
13 years 11 months ago
Verisim: Formal analysis of network simulations
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim...
ENTCS
2008
170views more  ENTCS 2008»
13 years 7 months ago
A Coq Library for Verification of Concurrent Programs
Thanks to recent advances, modern proof assistants now enable verification of realistic sequential programs. However, regarding the concurrency paradigm, previous work essentially...
Reynald Affeldt, Naoki Kobayashi
ECIS
2001
13 years 8 months ago
Re orienting information systems for customer centric service: The case of the Greek Ministry of Finance
Governments are employing modern information and communication technologies to better serve society. Raising the effectiveness of government as well as the quality of the civil se...
Dimitrios S. Stamoulis, Dimitris Gouscos, Panagiot...
JAR
2000
145views more  JAR 2000»
13 years 7 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
FROCOS
2000
Springer
13 years 11 months ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio