publication . Doctoral thesis . 2012

Software Components and Formal Methods from a Computational Viewpoint

Lambertz, Christian;
Open Access German
  • Published: 01 Jan 2012
  • Publisher: Universität Mannheim
  • Country: Germany
Software components and the methodology of component-based development offer a promising approach to master the design complexity of huge software products because they separate the concerns of software architecture from individual component behavior and allow for reusability of components. In combination with formal methods, the specification of a formal component model of the later software product or system allows for establishing and verifying important system properties in an automatic and convenient way, which positively contributes to the overall correctness of the system. Here, we study such a combined approach. As similar approaches, we also face the so...
free text keywords: 004 Informatik
Related Organizations
Download from
84 references, page 1 of 6

[145] John Edward Hopcroft, Rajeev Motwani, and Jeffrey David Ullman. Introduction to Automata Theory, Languages, and Computation, 3rd edition. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2006.

[146] Paola Inverardi and Sebastia´n Uchitel. Proving Deadlock Freedom in Component-Based Programming. In Heinrich Hußmann, editor, Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering (FASE 2001), volume 2029 of Lecture Notes in Computer Science, pages 60-75. Springer-Verlag, Berlin, Germany, 2001. [OpenAIRE]

[147] Chung-Wah Norris Ip and David L. Dill. Better Verification through Symmetry. In Proceedings of the 11th IFIP WG10.2 International Conference on Computer Hardware Description Languages and their Applications (CHDL 1993), pages 97-111. North-Holland, Amsterdam, The Netherlands, 1993.

[148] Pavel Jezˇek, Jan Kofronˇ , and Frantisˇek Pla´sˇil. Model Checking of Component Behavior Specification: A Real Life Experience. In Proceedings of the 2nd International Workshop on Formal Aspects of Component Software (FACS 2005), volume 160 of Electronic Notes in Theoretical Computer Science, pages 197-210. Elsevier B.V., Amsterdam, The Netherlands, 2006.

[149] Yuh-Jzer Joung and Scott Allen Smolka. Coordinating First-Order Multiparty Interactions. ACM Transactions on Programming Languages and Systems (TOPLAS), 16(3):954-985, 1994.

[150] Roope Kaivola. Compositional Model Checking for Linear-Time Temporal Logic. In Gregor von Bochmann and David Karl Probst, editors, Proceedings of the 4th International Workshop on Computer Aided Verification (CAV 1992), volume 663 of Lecture Notes in Computer Science, pages 248-259. Springer-Verlag, Berlin, Germany, 1993.

ter Rance Cleaveland, editor, Proceedings of the 3rd International Conference on Concurrency Theory (CONCUR 1992), volume 630 of Lecture Notes in Computer Science, pages 207-221. Springer-Verlag, Berlin, Germany, 1992.

[152] Paris Christos Kanellakis and Scott Allen Smolka. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. In Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing (PODC 1983), pages 228-240. ACM, New York, NY, USA, 1983.

[153] David Ron Karger and Matthew Steven Levine. Random Sampling in Residual Graphs. In Proceedings of the 34th ACM Symposium on Theory of Computing (STOC 2002), pages 63-66. ACM, New York, NY, USA, 2002.

[154] Richard Manning Karp. Understanding Science through the Computational Lens. Journal of Computer Science and Technology (JCST), 26(4): 569-577, 2011.

[155] Matt Kaufmann, Panagiotis Manolios, and J Strother Moore. ComputerAided Reasoning: An Approach. Kluwer Academic Publishers, Norwell, MA, USA, 2000.

[156] Matt Kaufmann, Panagiotis Manolios, and J Strother Moore. ComputerAided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers, Norwell, MA, USA, 2000.

[157] Robert Marion Keller. Formal Verification of Parallel Programs. Communications of the ACM (CACM), 19(7):371-384, 1976.

[158] Thomas Kropf. Introduction to Formal Hardware Verification: Methods and Tools for Designing Correct Circuits and Systems, 1st edition. SpringerVerlag, Berlin, Germany, 1999.

[159] Yat-Sang Kwong. On the Absence of Livelocks in Parallel Programs. In Gilles Kahn, editor, Proceedings of the International Symposium on Semantics of Concurrent Computation, volume 70 of Lecture Notes in Computer Science, pages 172-190. Springer-Verlag, Berlin, Germany, 1979.

84 references, page 1 of 6
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue