Sciweavers

698 search results - page 87 / 140
» Model Checking with Multi-valued Logics
Sort
View
CAV
2009
Springer
163views Hardware» more  CAV 2009»
15 years 10 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
DATE
2006
IEEE
117views Hardware» more  DATE 2006»
15 years 3 months ago
Formal verification of systemc designs using a petri-net based representation
This paper presents an effective approach to formally verify SystemC designs. The approach translates SystemC models into a Petri-Net based representation. The Petri-net model is ...
Daniel Karlsson, Petru Eles, Zebo Peng
LOGCOM
2010
96views more  LOGCOM 2010»
14 years 8 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
SEFM
2007
IEEE
15 years 4 months ago
Verifying Security Properties of Cryptoprotocols: A Novel Approach
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...
Mohamed Saleh, Mourad Debbabi
PPDP
2007
Springer
15 years 3 months ago
Mechanized metatheory model-checking
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
James Cheney, Alberto Momigliano