TCS / Research / Publications / An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic
Helsinki University of Technology, 
     Laboratory for Theoretical Computer Science

An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic

Reference:

Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi Junttila, Peter van Rossum, Stephan Schulz, and Roberto Sebastiani. An incremental and layered procedure for the satisfiability of linear arithmetic logic. In Nicolas Halbwachs and Lenore D. Zuck, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005), volume 3440 of Lecture Notes in Computer Science, pages 317–333. Springer, 2005.

Suggested BibTeX entry:

@inproceedings{BozzanoBruttomessoCimattiJunttilaRossumSchulzSebastiani:TACAS2005,
    author = {Marco Bozzano and Roberto Bruttomesso and Alessandro Cimatti and Tommi Junttila and Peter van Rossum and Stephan Schulz and Roberto Sebastiani},
    booktitle = {Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2005)},
    editor = {Nicolas Halbwachs and Lenore D. Zuck},
    pages = {317--333},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic},
    volume = {3440},
    year = {2005},
}

This work is not available online here.

[TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links]
Latest update: 19 January 2010.