Sciweavers

551 search results - page 26 / 111
» Natural proofs
Sort
View
LPAR
2012
Springer
12 years 5 months ago
E-Matching with Free Variables
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
Philipp Rümmer
CADE
2007
Springer
14 years 10 months ago
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
Samuli Heilala, Brigitte Pientka
DLOG
2007
14 years 8 days ago
A Constructive Semantics for ALC
One of the main concerns of constructive semantics is to provide a computational interpretation for the proofs of a given logic. In this paper we introduce a constructive semantics...
Loris Bozzato, Mauro Ferrari, Camillo Fiorentini, ...
MODELS
2009
Springer
14 years 4 months ago
Evaluating Context Descriptions and Property Definition Patterns for Software Formal Validation
A well known challenge in the formal methods domain is to improve their integration with practical engineering methods. In the context of embedded systems, model checking requires ...
Philippe Dhaussy, Pierre Yves Pillain, Stephen Cre...
DCC
2008
IEEE
14 years 9 months ago
Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
LaMacchia, Lauter and Mityagin recently presented a strong security definition for authenticated key agreement strengthening the well-known Canetti-Krawczyk definition. They also ...
Berkant Ustaoglu