Sciweavers

25 search results - page 2 / 5
» Formal Correctness Proof for DPLL Procedure
Sort
View
ECCC
2007
99views more  ECCC 2007»
13 years 4 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
LICS
2008
IEEE
13 years 11 months ago
Mechanizing the Metatheory of LF
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
Christian Urban, James Cheney, Stefan Berghofer
PLDI
2009
ACM
14 years 5 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
FM
2003
Springer
109views Formal Methods» more  FM 2003»
13 years 10 months ago
Certifying and Synthesizing Membership Equational Proofs
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
Grigore Rosu, Steven Eker, Patrick Lincoln, Jos&ea...
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 4 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux