Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

SAT-based Explicit LTLf Satisfiability Checking.

J. Li, K. Rozier, G. Pu, Y. Zhang, and M. Vardi. CoRR, (2018)

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.

Sebastian Putzke University of Stuttgart

Miroslav Puskaric University of Stuttgart

Andreea Puscasu University of Stuttgart

Simonetta Puleio University of Stuttgart

Einius Pultinevicius University of Stuttgart

Other publications of authors with the same name

A Formal Model for Compensable Transactions.J. Li, H. Zhu, G. Pu, and J. He. ICECCS, page 64-73. IEEE Computer Society, (2007)Verification of channel passing in choreography with model checking.L. Peng, C. Cai, Z. Qiu, and G. Pu. SOCA, page 1-5. IEEE Computer Society, (2009)Combining Syntactic and Semantic Encoding for LTL Bounded Model Checking.W. Liu, X. Mao, G. Pu, and R. Wang. TASE, page 82-89. IEEE Computer Society, (2014)Preface for the special issue for ATVA 2015.B. Finkbeiner, G. Pu, and L. Zhang. Acta Inf., 55 (8): 625-626 (2018)SAT-based Explicit LTLf Satisfiability Checking.J. Li, K. Rozier, G. Pu, Y. Zhang, and M. Vardi. CoRR, (2018)Approximate Reachability.J. Li, S. Zhu, Y. Zhang, G. Pu, and M. Vardi. CoRR, (2016)Execution Semantics for rCOS.Z. Wang, X. Yu, G. Pu, L. Feng, H. Zhu, and J. He. APSEC, page 119-126. IEEE Computer Society, (2008)Combining Symbolic Execution and Model Checking for Data Flow Testing.T. Su, Z. Fu, G. Pu, J. He, and Z. Su. ICSE (1), page 654-665. IEEE Computer Society, (2015)SimpleCAR: An Efficient Bug-Finding Tool Based on Approximate Reachability.J. Li, R. Dureja, G. Pu, K. Rozier, and M. Vardi. CAV (2), volume 10982 of Lecture Notes in Computer Science, page 37-44. Springer, (2018)On the Relationship between LTL Normal Forms and Büchi Automata.J. Li, G. Pu, L. Zhang, Z. Wang, J. He, and K. Larsen. Theories of Programming and Formal Methods, volume 8051 of Lecture Notes in Computer Science, page 256-270. Springer, (2013)

PUMA

Disambiguation of "Pu, Geguang"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

SAT-based Explicit LTLf Satisfiability Checking.

Please choose a person to relate this publication to

Sebastian Putzke University of Stuttgart

Miroslav Puskaric University of Stuttgart

Andreea Puscasu University of Stuttgart

Simonetta Puleio University of Stuttgart

Einius Pultinevicius University of Stuttgart

Other publications of authors with the same name

Disambiguation

PUMA

Disambiguation of "Pu, Geguang"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML SAT-based Explicit LTLf Satisfiability Checking.

Please choose a person to relate this publication to

Sebastian Putzke University of Stuttgart

Miroslav Puskaric University of Stuttgart

Andreea Puscasu University of Stuttgart

Simonetta Puleio University of Stuttgart

Einius Pultinevicius University of Stuttgart

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

SAT-based Explicit LTLf Satisfiability Checking.