3047 search results - page 32 / 610 » On the Meaning of Logical Completeness |
98
Voted
CAV
2009
Springer
15 years 10 months ago
2009
Springer
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...
SFM
2007
Springer
15 years 3 months ago
2007
Springer
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...
TABLEAUX
1997
Springer
15 years 1 months ago
1997
Springer
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
110
click to vote
PLDI
2011
ACM
14 years 15 days ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
101
click to vote
APSEC
2008
IEEE
14 years 11 months ago
2008
IEEE
Reactive systems are often described by interconnecting sub-components along architectural connectors defining communication policies. Generally, such global systems may exhibit p...