Formal methods in computing

MaRDI QIDQ3412585zbMATH OpenFDO

Authors

Publication date 28 December 2006

zbMATH Keywords

efficient algorithmsfinite-source queueing systemsgraph-theoretic methodsmetamodelingtree transducers

Mathematics Subject Classification ID

Logic in computer science (03B70) Graph algorithms (graph-theoretic aspects) (05C85) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27) General topics in the theory of algorithms (68W01) Analysis of algorithms (68W40)

Recommendations

• Formal methods for software engineering. Languages, methods, application domains. With a foreword by Manfred Broy and a contribution on the origins and development of formal methods by John V. Tucker
• scientific article; zbMATH DE number 5262134
• scientific article; zbMATH DE number 1088216
• The human face of computing
• scientific article; zbMATH DE number 48095

Cited in

(5)

• scientific article; zbMATH DE number 5722463 (Why is no real title available?)
• scientific article; zbMATH DE number 4092761 (Why is no real title available?)
• scientific article; zbMATH DE number 1542048 (Why is no real title available?)
• scientific article; zbMATH DE number 1380218 (Why is no real title available?)
• scientific article; zbMATH DE number 795668 (Why is no real title available?)

This page was built for publication: Formal methods in computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3412585)