( en | de | ru )

 

Disambiguation of "Barringer, Howard"

Author of the publication

copydeleteadd this publication to your clipboard
Practical CTL* Model Checking: Should SPIN be Extended?

, and . Int. J. Softw. Tools Technol. Transf., 2 (4): 350-365 (2000)

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.

Rasmus Barringer

Howard Nelson

Howard Foster

Howard Li

Howard Smoller

 

Other publications of authors with the same name

Efficient CTL* model checking for analysis of rainbow designs., , , , and . CHARME, volume 105 of IFIP Conference Proceedings, page 128-145. Chapman & Hall, (1997)Forays into Sequential Composition and Concatenation in Eagle., and . RV, volume 5289 of Lecture Notes in Computer Science, page 69-85. Springer, (2008)Internal versus External DSLs for Trace Analysis - (Extended Abstract)., and . RV, volume 7186 of Lecture Notes in Computer Science, page 1-3. Springer, (2011)Modal and Temporal Argumentation Networks., and . Essays in Memory of Amir Pnueli, volume 6200 of Lecture Notes in Computer Science, page 1-25. Springer, (2010)A Graph-Based Approach to Resolution in Temporal Logic., , and . ICTL, volume 827 of Lecture Notes in Computer Science, page 415-429. Springer, (1994)A Semantics Driven Temporal Verification System., and . ESOP, volume 300 of Lecture Notes in Computer Science, page 21-33. Springer, (1988)Practical CTL* Model Checking: Should SPIN be Extended?, and . Int. J. Softw. Tools Technol. Transf., 2 (4): 350-365 (2000)Modelling Evolvable Systems: A Temporal Logic View., and . We Will Show Them! (1), page 195-228. College Publications, (2005)Effective State Exploration for Model Checking on a Shared Memory Architecture., and . PDMC@CONCUR, volume 68 of Electronic Notes in Theoretical Computer Science, page 605-620. Elsevier, (2002)Editorial.. J. Log. Comput., 1 (5): 573-574 (1991)