Registrera dig | Logga in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

mccrimsons library [35 articles]

Senaste artiklarna i mccrimsons bibliotek.
  • Completeness and complexity of bounded model checking
    (2004)
    by E Clarke, D Kroening, J El, O Ofer
    posted to no-tag by mccrimson on 2008-07-14 09:32:43 as **
  • An Analysis of SAT-based Model Checking
    by Techniques I An
    posted to no-tag by mccrimson on 2007-11-16 07:46:34 as **
  • Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers
    Vol. 3925 (2006), pp. 146-162.
    by Alessandro Armando, Jacopo Mantovani, Lorenzo Platania
    edited by Antti Valmari, Antti Valmari
    posted to no-tag by mccrimson on 2007-11-16 07:41:45 as *****
  • Bounded Model Checking with QBF
    Theory and Applications of Satisfiability Testing (2005), pp. 408-414.
    by Nachum Dershowitz, Ziyad Hanna, Jacob Katz
    posted to no-tag by mccrimson on 2007-11-16 07:37:52 as **
  • Interpolation and SAT-Based Model Checking
    : Computer Aided Verification (2003), pp. 1-13.
    by KL Mcmillan
    posted to no-tag by mccrimson on 2007-11-16 07:29:58 as ***** along with 1 person and 1 group pganty groupverif
  • Checking Safety Properties Using Induction and a SAT-Solver
    Formal Methods in Computer-Aided Design: Third International Conference, FMCAD 2000, Austin, TX, USA, November 2000. Proceedings (2000), 108.
    by Mary Sheeran, Satnam Singh, Gunnar Stålmarck
    posted to no-tag by mccrimson on 2007-11-16 07:13:24 as *****
  • A Tutorial on St\aalmarck's Proof Procedure for Propositional Logic
    Vol. 1522 (1998), pp. 82-99.
    by Mary Sheeran, Gunnar St\aalmarck
    edited by G Gopalakrishnan, P Windley
    posted to no-tag by mccrimson on 2007-11-16 07:08:55 as *****
  • Simple bounded LTL model checking
    (2004)
    posted to no-tag by mccrimson on 2007-10-19 09:46:39 as **
  • Evaluation of SAT-based Bounded Model Checking of ACTL Properties
    Theoretical Aspects of Software Engineering, 2007. TASE '07
    by Xu Yanyan, Chen Wei, Xu Liang, Zhang Wenhui
    posted to no-tag by mccrimson on 2007-10-19 09:31:01 as **
  • RSat 2.0: SAT Solver Description
    (2007)
    by Knot
    posted to no-tag by mccrimson on 2007-10-19 09:13:11 as **
  • An Extensible SAT-solver
    Theory and Applications of Satisfiability Testing (2004), pp. 502-518.
    by Niklas Eén, Niklas Sörensson
    posted to no-tag by mccrimson on 2007-10-19 09:07:49 as ** along with 4 people bfraser tuncay voronov krauss
  • Chaff: Engineering an Efficient SAT Solver
    (2001)
    by Matthew W Moskewicz, Conor F Madigan, Ying Zhao, Lintao Zhang, Sharad Malik
    posted to no-tag by mccrimson on 2007-10-19 08:49:34 as ** along with 1 person luisgil
  • SATO: an efficient propositional prover
    (1997), pp. 272-275.
    by Hantao Zhang
    posted to no-tag by mccrimson on 2007-10-19 08:46:35 as **
  • Verification of the Futurebus+ Cache Coherence Protocol
    (1993), pp. 5-20.
    by EM Clarke, O Grumberg, H Hiraishi, S Jha, DE Long, KL Mcmillan, LA Ness
    edited by D Agnew, L Claesen, R Camposano
    posted to no-tag by mccrimson on 2007-10-19 08:11:02 as **
  • Symbolic Model Checking: $10^20$ States and Beyond
    (1990), pp. 1-33.
    by J Burch, E Clarke, K Mcmillan, D Dill, L Hwang
    posted to no-tag by mccrimson on 2007-10-19 08:00:58 as ** along with 4 people mercutio Benet johannsen zuleger
  • Automatic verification of finite-state concurrent systems using temporal logic specifications
    ACM Trans. Program. Lang. Syst., Vol. 8, No. 2. (April 1986), pp. 244-263.
    by EM Clarke, EA Emerson, AP Sistla
    posted to no-tag by mccrimson on 2007-10-19 07:35:47 as ** along with 2 people and 1 group hmeyer pintman gk-intern
  • Design and synthesis of synchronization skeletons using branching time temporal logic
    Logics of Programs (1982), pp. 52-71.
    by Edmund Clarke, E Emerson
    posted to no-tag by mccrimson on 2007-10-19 07:24:45 as ** along with 2 people hwang Maderlock
  • Solving Non-clausal Formulas with DPLL search
    (2004)
    by Christian Thiffault, Fahiem Bacchus, Toby Walsh
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Satisfiability Checking of Non-clausal Formulas Using General Matings
    Vol. 4121 (2006), pp. 75-89.
    by Himanshu Jain, Constantinos Bartzis, Edmund M Clarke
    edited by Armin Biere, Carla P Gomes
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Improving the Encoding of LTL Model Checking into SAT
    Vol. 2294 (2002), pp. 196-207.
    by Alessandro Cimatti, Marco Pistore, Marco Roveri, Roberto Sebastiani
    edited by Agostino Cortesi
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • The Optimality of a Fast CNF Conversion and its Use with SAT
    (2004)
    by Daniel Sheridan
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • NuSMV: A New Symbolic Model Verifier
    (1999), pp. 495-499.
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Symbolic Reachability Analysis based on SAT-Solvers
    Vol. 1785 (2000), pp. 411-425.
    by Parosh A Abdulla, Per Bjesse, Niklas Eén
    edited by Susanne Graf, Michael Schwartzbach
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Model Checking
    (January 2000)
    by Edmund Clarke, Orna Grumberg, Doron Peled
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic
    (1981), pp. 52-71.
    by EM Clarke, EA Emerson
    edited by D Kozen
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • The Temporal Logic of Branching Time
    ACTAINF: Acta Informatica, Vol. 20 (1983)
    by Ben Ari, Pnueli, Manna
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Linear Encodings of Bounded LTL Model Checking
    (November~JanuaryJune 2006)
    by Armin Biere, Keijo Heljanko, Tommi Junttila, Timo Latvala, Viktor\par Schuppan
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Simple Is Better: Efficient Bounded Model Checking for Past LTL
    Vol. 3385 (2005), pp. 380-395.
    by Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A Junttila
    edited by Radhia Cousot
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Simple Bounded LTL Model Checking
    Vol. 3312 (2004), pp. 186-200.
    by Timo Latvala, Armin Biere, Keijo Heljanko, Tommi A Junttila
    edited by Alan J Hu, Andrew K Martin
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Proving forall-$μ$-Calculus Properties with SAT-Based Model Checking
    Vol. 3731 (2005), pp. 113-127.
    by Bow Y Wang
    edited by Farn Wang
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Bounded Model Checking for Past LTL
    Vol. 2619 (2003), pp. 18-33.
    by Marco Benedetti, Alessandro Cimatti
    edited by Hubert Garavel, John Hatcliff
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Bounded Model Checking for the Universal Fragment of CTL
    FUNDINF: Fundamenta Informatica, Vol. 51 (2002)
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • On the Compexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
    IEEE Transactions on Computers, Vol. 40, No. 2. (February 1991), pp. 205-213.
    by RE Bryant
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Symbolic Model Checking without BDDs
    Vol. 1579 (1999), pp. 193-207.
    by Armin Biere, Alessandro Cimatti, Edmund Clarke, Yunshan Zhu
    edited by WR Cleaveland
    posted to bibtex-import by mccrimson on 2007-10-19 03:10:06 as **
  • Bounded LTL Model Checking with Stable Models
    Vol. 2173 (September 2001), pp. 200-212.
    by Keijo Heljanko, Ilkka Niemelä
    edited by Thomas Eiter, Wolfgang Faber, Mirosaw Truszczynski
    posted to no-tag by mccrimson on 2007-10-19 03:07:25 as read
  • Du kan hänvisa till den här sidan som: http://www.citeulike.org/user/mccrimson

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.