BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × China
1 × Finland
1 × Russia
1 × USA
2 × France
2 × Italy
3 × United Kingdom
Collaborated with:
J.Marques-Silva Z.Stachniak A.Gurfinkel J.P.M.Silva M.Heule M.Janota N.Manthey M.Järvisalo H.Chen A.Mishchenko A.Ivrii A.Matsliah
Talks about:
satisfi (4) bit (4) proposit (3) extract (3) search (3) minim (3) local (3) mus (3) variabl (2) formula (2)

Person: Anton Belov

DBLP DBLP: Belov:Anton

Contributed to:

SAT 20142014
TACAS 20142014
CAV 20132013
DATE 20132013
SAT 20132013
TACAS 20132013
SAT 20122012
SAT 20112011
SAT 20102010
SAT 20092009
SAT 20082008
SAT 20052005

Wrote 13 papers:

SAT-2014-BelovHM #proving #using
MUS Extraction Using Clausal Proofs (AB, MH, JMS), pp. 48–57.
TACAS-2014-GurfinkelB #contest #named #verification
FrankenBit: Bit-Precise Verification with Many Bits — (Competition Contribution) (AG, AB), pp. 408–411.
TACAS-2014-GurfinkelBM #invariant
Synthesizing Safe Bit-Precise Invariants (AG, AB, JMS), pp. 93–108.
CAV-2013-Marques-SilvaJB #set
Minimal Sets over Monotone Predicates in Boolean Formulae (JMS, MJ, AB), pp. 592–607.
DATE-2013-Belov0MM #abstraction #satisfiability
Core minimization in SAT-based abstraction (AB, HC, AM, JMS), pp. 1411–1416.
SAT-2013-BelovMM #parallel
Parallel MUS Extraction (AB, NM, JMS), pp. 133–149.
TACAS-2013-BelovJM #preprocessor
Formula Preprocessing in MUS Extraction (AB, MJ, JMS), pp. 108–123.
SAT-2012-BelovIMM #on the #performance
On Efficient Computation of Variable MUSes (AB, AI, AM, JMS), pp. 298–311.
SAT-2011-BelovS #satisfiability
Minimally Unsatisfiable Boolean Circuits (AB, JPMS), pp. 145–158.
SAT-2010-BelovS #satisfiability
Improved Local Search for Circuit Satisfiability (AB, ZS), pp. 293–299.
SAT-2009-BelovS #probability #process #satisfiability
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability (AB, ZS), pp. 258–264.
SAT-2008-StachniakB #learning #satisfiability
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (ZS, AB), pp. 257–270.
SAT-2005-BelovS #logic #satisfiability
Substitutional Definition of Satisfiability in Classical Propositional Logic (AB, ZS), pp. 31–45.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.