scientific article; zbMATH DE number 1956592

MaRDI QIDQ4417937zbMATH OpenFDO

Authors Stavros Tripakis

Publication date 30 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2619/26190347.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Automatic behavior composition synthesis
• Qualitative approximate behavior composition
• Modular synthesis with open components
• Publication:4721637
• Approximating Component Selection with General Costs

Cited in

(5)

• scientific article; zbMATH DE number 1324080 (Why is no real title available?)
• Automatic generation of make dependencies
• Using logic to solve the submodule construction problem
• scientific article; zbMATH DE number 2079874 (Why is no real title available?)
• Modular code generation from synchronous block diagrams: modularity vs. code size

This page was built for publication:

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