( en | de | ru )

 

Disambiguation of "van Rossum, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic.

, , , , , , and . TACAS, volume 3440 of Lecture Notes in Computer Science, page 317-333. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Walter Rossum

Daniël Rossum

Curt Rossum

Maria Rossum

Thea Rossum

 

Other publications of authors with the same name

Safe Equivalences for Security Properties., , , and . IFIP TCS, volume 323 of IFIP Advances in Information and Communication Technology, page 55-70. Springer, (2010)Computing the Leakage of Information-Hiding Systems., , , and . TACAS, volume 6015 of Lecture Notes in Computer Science, page 373-389. Springer, (2010)Conditional Probabilities over Probabilistic and Nondeterministic Systems., and . TACAS, volume 4963 of Lecture Notes in Computer Science, page 157-172. Springer, (2008)Significant Diagnostic Counterexamples in Probabilistic Model Checking., , and . Haifa Verification Conference, volume 5394 of Lecture Notes in Computer Science, page 129-148. Springer, (2008)Provable anonymity., , , and . FMSE, page 63-72. ACM, (2005)Efficient Satisfiability Modulo Theories via Delayed Theory Combination., , , , , , and . CAV, volume 3576 of Lecture Notes in Computer Science, page 335-349. Springer, (2005)An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic., , , , , , and . TACAS, volume 3440 of Lecture Notes in Computer Science, page 317-333. Springer, (2005)Modeling Privacy for Off-Line RFID Systems., and . CARDIS, volume 6035 of Lecture Notes in Computer Science, page 194-208. Springer, (2010)Information Hiding in Probabilistic Concurrent Systems., , , and . QEST, page 17-26. IEEE Computer Society, (2010)Computational Soundness of Non-Malleable Commitments., , and . ISPEC, volume 4991 of Lecture Notes in Computer Science, page 361-376. Springer, (2008)