( en | de | ru )

 

Disambiguation of "Wang, Farn"

Author of the publication

copydeleteadd this publication to your clipboard
Verifying Recursive Programs Using Intraprocedural Analyzers.

, , , , and . SAS, volume 8723 of Lecture Notes in Computer Science, page 118-133. Springer, (2014)

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.

Rolf Farnsteiner

Ute Farny

Christopher Farnsworth

Christine Farnhammer

Winfried Farnung

 

Other publications of authors with the same name

Symbolic Verification of Complex Real-Time Systems with Clock-Restriction Diagram.. FORTE, volume 197 of IFIP Conference Proceedings, page 235-250. Kluwer, (2001)Efficient Verification of Timed Automata with BDD-Like Data-Structures.. VMCAI, volume 2575 of Lecture Notes in Computer Science, page 189-205. Springer, (2003)Symbolic Simulation-Checking of Dense-Time Automata.. FORMATS, volume 4763 of Lecture Notes in Computer Science, page 352-368. Springer, (2007)Test automation for kernel code and disk arrays with virtual devices., , , and . ASE, page 505-508. ACM, (2007)Timing Parameter Characterization of Real-Time Systems., and . CIAA, volume 2759 of Lecture Notes in Computer Science, page 23-34. Springer, (2003)Symbolic consistency checking of OpenMp parallel programs., , , , and . LCTES, page 139-148. ACM, (2012)Procedure-Level Verification of Real-time Concurrent Systems., and . FME, volume 1051 of Lecture Notes in Computer Science, page 682-701. Springer, (1996)Synthesize Models for Quantitative Analysis Using Automata Learning., , , , , and . NETYS, volume 11704 of Lecture Notes in Computer Science, page 75-92. Springer, (2019)A Temporal Logic for the Interaction of Strategies., , and . CONCUR, volume 6901 of Lecture Notes in Computer Science, page 466-481. Springer, (2011)Automatic Verification on the Large., and . HASE, page 134-141. IEEE Computer Society, (1998)